Citadel / Citadel Securities logoCitadel / Citadel Securities
Coding·60 minMembers

N-ary Tree Sum + Leaf `next` Pointer

Members only

Citadel Data Storage / Infra technical phone screen: define a tree-node structure, compute the sum of all node values, then connect all leaf nodes in DFS order using a `next` pointer. The final follow...

SWE
Infra Eng
tree
dfs
tree-traversal
recursion
linked-list
complexity-analysis
medium
Frequency
Single report
Last asked
2026-06-13
Stage
phone-screen

Log in to continue reading the full content

Comments

Sign in to join the discussion
Loading...