题解 | #二叉树的深度#

/* function TreeNode(x) {
    this.val = x;
    this.left = null;
    this.right = null;
} */
function TreeDepth(pRoot)
{
    // write code here
    // const count = 0
    if(!pRoot){
        return 0;
    }
    return Math.max(TreeDepth(pRoot.left),TreeDepth(pRoot.right)) + 1;
}
module.exports = {
    TreeDepth : TreeDepth
};