/**
* Definition for binary tree
* 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;
int leftMaxDepth=maxDepth(root->left);
int rightMaxDepth=maxDepth(root->right);
if(leftMaxDepth>rightMaxDepth)
return leftMaxDepth+1;
else return rightMaxDepth+1;
}
};
附题目
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.