[−][src]Module leetcode_for_rust::cd0104_maximum_depth_of_binary_tree
Maximum Depth of Binary Treeleetcode: 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.
Structs
TreeNode |
Functions
max_depth | Solutions |