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