题解 | #二叉树的深度#
二叉树的深度
http://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
}
}
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public int TreeDepth(TreeNode root) {
//结束条件
if(root==null)
return 0;
//深搜遍历，比较深度，每一层数值+1
return Math.max(TreeDepth(root.left),TreeDepth(root.right))+1;}
}
投递快手等公司10个岗位 >
查看13道真题和解析