题解 | #二叉树的深度#

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 dfs(root);
    }
    public int dfs(TreeNode root){
        if(root == null){
            return 0;
        }
       int h = Math.max(dfs(root.left),dfs(root.right)) + 1;
       return h;
    }
}