【剑指offer】二叉树的深度

二叉树的深度

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;
        }
        else{
            int l = TreeDepth(root.left);
            int r = TreeDepth(root.right);
            return l>r?l+1:r+1;
        }
        
    }
}

2.运行结果