题解 | #二叉树的深度#

//深度遍历求树高

/**
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) {
        return deep(root);
    }
    public int deep(TreeNode root){
        if(root == null){
            return 0;
        }
        return (deep(root.left)+1) > (deep(root.right)+1) ?  (deep(root.left)+1) : (deep(root.right)+1);
    }
}