题解 | #二叉树的深度#
二叉树的深度
https://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b
/* function TreeNode(x) {
this.val = x;
this.left = null;
this.right = null;
} */
function TreeDepth(pRoot)
{
// write code here
if (pRoot === null) return 0
const subMax = Math.max(TreeDepth(pRoot.left), TreeDepth(pRoot.right))
return subMax + 1
}
module.exports = {
TreeDepth : TreeDepth
};
