Leetcode 559. Maximum Depth of N-ary Tree

Given the root of an n-ary tree, return its maximum depth — the number of nodes along the longest root-to-leaf path. This is a simple DFS/BFS traversal problem (n ≤ 10^4, depth ≤ 1000).