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.
解题思路:决定采用递归算法来解决这个问题,结束条件是当树为空时,高度为0,所以返回0.当树不为空时,比较左子树和右子树的高度,返回较高的高度加一。
代码:
/**
* 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) {
int result = 0;
if(root== NULL)
{
return 0;
}
else
{
int leftlen = maxDepth(root->left);
int rigthlen = maxDepth(root->right);
if(leftlen >= rigthlen)
{
result = leftlen+1;
}
else
{
result = rigthlen+1;
}
return result;
}
}
};