Maximum Depth of Binary Tree 27

Easy

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

Example 1

Input: root = nested tree (depth 4)

Output: 4

Constraints

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

maxDepth