leetcode-Easy-31-Tree- Maximum D

作者: 石头说钱 | 来源:发表于2019-04-15 23:47 被阅读1次

leetcode-Easy-31-Tree- Maximum D
LeetCode_104_Maximum Depth of Bi
CUC-SUMMER-2-D
Leetcode算法解析101+
149. Max Points on a Line - 草稿
149. Max Points on a Line
Leetcode 149. Max Points on a Li
翻译(面试试题)
149. Max Points on a Line
149. Max Points on a Line

题目:找出二叉树的最大深度

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 1

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

    3
   / \
  9  20
    /  \
   15   7
return its depth = 3.

解法

var maxDepth = function(root) {
    if(!root) return 0
    return 1 + Math.max(maxDepth(root.left),maxDepth(root.right))
};

网友评论

本文标题：leetcode-Easy-31-Tree- Maximum D

本文链接：https://www.haomeiwen.com/subject/xkbmwqtx.html

延伸阅读

深度阅读

您也可以注册成为美文阅读网的作者，发表您的原创作品、分享您的心情！

leetcode-Easy-31-Tree- Maximum D

题目:找出二叉树的最大深度

相关文章

leetcode-Easy-31-Tree- Maximum D

LeetCode_104_Maximum Depth of Bi

CUC-SUMMER-2-D

Leetcode算法解析101+

149. Max Points on a Line - 草稿

149. Max Points on a Line

Leetcode 149. Max Points on a Li

翻译(面试试题)

149. Max Points on a Line

149. Max Points on a Line

网友评论

延伸阅读

深度阅读

栏目导航

热点阅读

leetcode --- js版本

程序员