problem

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.

approach1:

深度优先

class Solution {
    public int maxDepth(TreeNode root) {
        if (root == null) {
            return 0;
        }
        return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));

    }
}

复杂度

time:O(n)
space:O(n)

本文标题：29.二叉树的最大深度:leetcode104
本文作者：sanwanliu
本文链接：https://sanwanliu.github.io/2019/09/17/29-二叉树的最大深度-leetcode104/
发布时间：2019-09-17
版权声明：本博客所有文章除特别声明外，均采用 CC BY-NC-SA 4.0 许可协议。转载请注明出处！

problem

approach1:

Comments

Catalogue

Your browser is out-of-date!