Leetcode - Maximum Depth of Binary Tree

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.

Solution:
1. Recursive:

2. Non-recursive: