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.
O(n)
O(n)
Run make to build and run C++ files and run Swift files. Or you can run .playground file.