Given a binary tree, return its maximum depth -- the number of nodes on the longest root-to-leaf path. A single root with no children has depth 1. An empty tree has depth 0.

The human eye anchors on visual bulk -- the wide, bushy part of a tree. But depth is determined by the longest single chain, and a thin branch hiding behind a bushy facade can dominate the answer without being noticed.