Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Maximum Depth of Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Clone N-ary Tree
Coding
- Diameter of N-Ary Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 2 records
Apple
Leetcode 559. Maximum Depth of N-ary Tree
Reported Sep 13, 2024 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceMerge
Leetcode 559. Maximum Depth of N-ary Tree
Reported Jul 6, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source