Maximum Depth of Binary Tree 40

Easy

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

Example 1

Input: root = nested tree (depth 5)

Output: 5

Constraints

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

maxDepth