题解 | #二叉树的深度#
二叉树的深度
http://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b
if (root == null) {
return 0;
}
return Math.max(TreeDepth(root.right), TreeDepth(root.left)) + 1;
二叉树的深度
http://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b
if (root == null) {
return 0;
}
return Math.max(TreeDepth(root.right), TreeDepth(root.left)) + 1;
相关推荐