二叉树的深度
二叉树的深度
http://www.nowcoder.com/questionTerminal/435fb86331474282a3499955f0a41e8b
//解题思路：
//递归判断左右子节点哪个更大
public int TreeDepth(TreeNode root) {
if(root == null) {
return 0;
}
int leftDepth = TreeDepth(root.left);
int rightDepth = TreeDepth(root.right);
int depth = leftDepth > rightDepth ? leftDepth : rightDepth;
return depth + 1;
}
