LeetCode104. Maximum Depth of Binary Tree
Posted 华仔要长胖
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode104. 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; }
Complexity
Time complexity : O(n)
Space complexity : O(logn)
More:【目录】LeetCode Java实现
以上是关于LeetCode104. Maximum Depth of Binary Tree的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode104. Maximum Depth of Binary Tree
leetcode104-Maximum Depth of Binary Tree
Leetcode刷题记录[python]——104 Maximum Depth of Binary Tree
LeetCode 104. Maximum Depth of Binary Tree
[Lintcode]97. Maximum Depth of Binary Tree/[Leetcode]104. Maximum Depth of Binary Tree