Available question text
Maintain an evolving rooted family tree (king as root) that supports adding a child and marking a person dead, and return the current inheritance order defined by a preorder (DFS) traversal that lists each person before their children in birth order, skipping deceased members. The core challenge is efficiently handling online updates and queries where the inheritance order follows this fixed traversal rule.
Related questions
Continue with questions that share topics or the same question type.
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Count Paths That Can Form a Palindrome in a Tree
Coding · Bit Manipulation · Depth-First Search · Hash Table
- Flatten Nested List Iterator
Coding · Depth-First Search · Design · Iterator
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Apple
Leetcode 1600. Throne Inheritance
Reported May 5, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Snowflake
Throne Inheritance
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 72.2. This is not an interview probability.
View source