N-ary Tree DFS by Rank | Dataford Interview Questions

Given an organisation N-ary tree (id, name, child orgs, rank, parent), output nodes depth-first while respecting rank priority among siblings.

Asked in the Technical stage. Implement output_org_ids(root). Each node is a dictionary with id, name, child_orgs, rank, and parent; parent is informational and may be null. Return node IDs in preorder depth-first traversal. Sort each node's children by ascending rank; equal ranks retain their original child-list order.

Constraints

0 <= number of nodes <= 1,000
Node IDs are unique
Each node has a list of child_orgs
Ranks are integers
The structure is a valid tree with no cycles
Equal ranks preserve input order

Function Signature

def output_org_ids(root):

Your question is N-ary Tree DFS by Rank. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given an organisation N-ary tree (id, name, child orgs, rank, parent), output nodes depth-first while respecting rank priority among siblings.

Constraints

0 <= number of nodes <= 1,000
Node IDs are unique
Each node has a list of child_orgs
Ranks are integers
The structure is a valid tree with no cycles
Equal ranks preserve input order

Function Signature

def output_org_ids(root):

Your question is N-ary Tree DFS by Rank. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.