题解 | #二叉树的深度#

/* function TreeNode(x) {
    this.val = x;
    this.left = null;
    this.right = null;
} */
// 解题思路：递归，取左右子树的最大值，然后+1即可
// dp[root]=max(dp[left],dp[right])+1
function TreeDepth(pRoot)
{
    // write code here
    if(pRoot==null)return 0;
    let leftDepth=TreeDepth(pRoot.left)
    let rightDepth=TreeDepth(pRoot.right)
    return Math.max(leftDepth,rightDepth)+1
}
module.exports = {
    TreeDepth : TreeDepth
};