[leetcode]104. Maximum Depth of Binary Tree
Analysis
刷题and学英语and学算法—— [坚持吖~]
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.
这题是求一个二叉树的深度,跟前面两题一样同样用递归实现,很简单啦~
Implement
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int maxDepth(TreeNode* root) {
if(root==NULL)
return 0;
else
return max(maxDepth(root->left), maxDepth(root->right))+1;
}
};