题解 | #二叉树的深度#

递归求解二叉树的深度，若不为空，直接返回左子树和右子树深度的较大值+1

/**
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;
        return Math.max(1+TreeDepth(root.left),1+TreeDepth(root.right));
    }
}