Maximum Depth of Binary Tree 37

Easy

Return the maximum depth of a binary tree. Trees are passed as nested objects `{ val, left, right }`. Variant **#37**.

Example 1

Input: root = nested tree (depth 2)

Output: 2

Constraints

Acceptance: 65% · Topics: tree, dfs, bfs

maxDepth