Maximum Depth of Binary Tree (#104)

Given the root of a binary tree, return its maximum depth.

A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Company Tags: Amazon, Microsoft

Core Concept: Tree, Depth-First Search (DFS)

Solve on LeetCode