二叉树的高度
二叉树的深度
http://www.nowcoder.com/questionTerminal/435fb86331474282a3499955f0a41e8b
import java.util.*;
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;
else return 1 + Math.max(TreeDepth(root.left), TreeDepth(root.right));
}
}
查看20道真题和解析