Maximum Depth of Binary Tree

Given a binary tree in level-order form (null for a missing child), print its maximum depth, the number of nodes on the longest root-to-leaf path.

0 <= number of nodes <= 10^4 -100 <= value <= 100