Maximum Depth of Binary Tree 38

Easy

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

Example 1

Input: root = nested tree (depth 3)

Output: 3

Constraints

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

maxDepth