Return the maximum depth of a binary tree. Trees are passed as nested objects `{ val, left, right }`. Variant **#32**.
Example 1
Input: root = nested tree (depth 3)
Output: 3
Constraints
Acceptance: 77% · Topics: tree, dfs, bfs
← All practice problems