104. Maximum Depth of Binary Tree（js）

104. Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

    3
   /   9  20
    /     15   7

return its depth = 3.

题意：求二叉搜索树的深度

代码如下：

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number}
 */
var maxDepth = function(root) {
    if(!root) return 0;
    var maxLeft=!root.left ? 0 : maxDepth(root.left)
    var maxRight=!root.right ? 0 : maxDepth(root.right)
    
    return 1+Math.max(maxLeft,maxRight);
};

104. Maximum Depth of Binary Tree（js）

原文：https://www.cnblogs.com/xingguozhiming/p/10713082.html