Problem 559 · Easy

Maximum Depth of N-ary Tree

Measure an n-ary tree by recursing into every child and keeping the deepest branch, counting the current node.

Open the interactive visualisation