Problem 104 · Easy

Maximum Depth of Binary Tree

Return 1 + max(left depth, right depth) in a simple DFS.

Open the interactive visualisation