题目:
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.
代码: int maxDepth(TreeNode* root) {
int i = 0;
int j = 0;
if(root == NULL)
{
return 0;
}
if(root->left)
{
i = maxDepth(root->left);
}
else
{
i = 0;
}
if(root->right)
{
j = maxDepth(root->right);
}
else
{
j = 0;
}
return (i > j)? i+1: j+1;
}
分别计算左子树,右子树的深度,运用递归.