Skip to content

Instantly share code, notes, and snippets.

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
3
/ \
9 20
/ \
15 7
/**