题解 | #二叉树的深度#解法:BFS层序遍历与DFS深度遍历(递归实现)

/**
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 maxChild(0,root);
        
    }
    int maxChild(int level,TreeNode root)
    {
        if(root==null)
           return 0;
        else
        return Math.max(maxChild(level,root.left)+1,maxChild(level,root.right)+1) ;
    }
}