104. Maximum Depth of Binary Tree

最新推荐文章于 2020-04-07 01:17:51 发布

onefanyf

最新推荐文章于 2020-04-07 01:17:51 发布

阅读量70

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_34471804/article/details/102473465

版权

leetcode 专栏收录该内容

77 篇文章 0 订阅

订阅专栏

#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.
在这里插入图片描述

/**
 * 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;
     }
    let leftDepth = maxDepth(root.left);
    let rightDepth = maxDepth(root.right);
    return Math.max(leftDepth,rightDepth)+1;
};