[Leetcode] Maximum Depth of Binary Tree

Problem 

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.

Algorithm 

depth(root) = Max(depth(root.left), depth(root.right)) + 1

Code