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).
Asked at:
Apple
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid September, 2024
Apple
Senior
Depth of a binary tree
Hello Interview Premium
Your account is free and you can post anonymously if you choose.