Problem Statement


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

The maximum depth is the number of nodes along the longest path from the root down to the farthest leaf node.







Brute Force Intuition


In an interview, you can explain it like this:


Traverse every...