首页 > 代码库 > [LeetCode] Maximum Depth of Binary Tree
[LeetCode] Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ int maxP(TreeNode *p,int len){ if(p==NULL) return len; else { int a = maxP(p->left,len+1); int b = maxP(p->right,len+1); return a>b ? a:b ; }}class Solution {public: int maxDepth(TreeNode *root) { int len=0; len = maxP(root,len); return len; }};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。