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.
Definition of a tree:
Implement function maxDepth that returns the maximum depth of the tree.
Function maxDepth returns 3 because the longest path from the root 5 to the farthest leaf 1 contains 3 nodes.