This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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 | |
/** |