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) {}
* };
*/
class Solution {
public:
int depth(TreeNode *node)
{
if(node==NULL)
return 0;
int leftDepth=depth(node->left);
int rightDepth=depth(node->right);
return leftDepth>rightDepth?leftDepth+1:rightDepth+1;
}
int maxDepth(TreeNode *root) {
if(root==NULL)
return 0;
int leftDepth=depth(root->left);
int rightDepth=depth(root->right);
return leftDepth>rightDepth?leftDepth+1:rightDepth+1;
}
};