题解 | #二叉树的深度#

动态规划 1.定义数组元素的含义 2.数组间的关系 3.初始值处理

public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    private int ret=0;
    public int TreeDepth(TreeNode root) {
      //动态规划
        dfs(root,0);
        return ret;
    }
    public void dfs(TreeNode root,int depth)
    {
        if(root!=null)
        {
            ret=Math.max(ret,++depth);
            dfs(root.left,depth);
            dfs(root.right,depth);
            
        }
    }
}