Maximum Depth of Binary Tree
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 2:
Example 3:
Example 4:
Constraints:
The number of nodes in the tree is in the range
[0, 104]
.-100 <= Node.val <= 100
Solutions
🧠 Cpp
Last updated