104. Maximum Depth of Binary Tree
Easy
Given the root
of a binary tree, return its maximum depth.
A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
Example 1:
Example 2:
Constraints:
The number of nodes in the tree is in the range
[0, 10^4]
.-100 <= Node.val <= 100
解題
Previous103. Binary Tree Zigzag Level Order TraversalNext105. Construct Binary Tree from Preorder and Inorder Traversal
Last updated