编程算法Maximum Depth of Binary Tree
编程算法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.
solution:递归
code:
class Solution {
public:
int maxDepth(TreeNode* root) {
return root == NULL ? 0 : max(maxDepth(root -> left), maxDepth(root -> right)) + 1;
}
};
相关文章
图文推荐
- 文章
- 推荐
- 热门新闻