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 maxDepth(TreeNode *root){
if(root == NULL)return 0;
if(root->left == NULL && root->right == NULL)return 1;
int ldepth = 0;
int rdepth = 0;
if(root->left!=NULL)
ldepth += maxDepth(root->left);
if(root->right!= NULL)
rdepth += maxDepth(root->right);
return (ldepth > rdepth ? ldepth+1 : rdepth+1);
}};
<pre name="code" class="java">public class Solution{
public int maxDepth(TreeNode root){
if(root == null)return 0;
if(root.left == null && root.right == null)return 1;
int ldepth = 0;
int rdepth = 0;
if(root.left!=null)
ldepth += maxDepth(root.left);
if(root.right!= null)
rdepth += maxDepth(root.right);
return (ldepth > rdepth ? ldepth+1 : rdepth+1);
}
};