【LeetCode】104. Maximum Depth of Binary Tree

Difficulty:easy

 More:【目录】LeetCode Java实现

Description

https://leetcode.com/problems/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.

Intuition

1.Recursion

Solution

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

　　

扫描二维码关注公众号，回复： 7634270 查看本文章

Complexity

Time complexity : O(n)

Space complexity : O(logn)

  

 More:【目录】LeetCode Java实现