# 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.

Example

```
1
/ \
2 3 Max Depth = 4
/ \ 1->3->4->6
4 5
\
6
```