Halloween Sale
Unlock all premium questions for over 30% off
Traverse and Merge Two Keyed N-ary Trees
Hard
Question
An N-ary tree is stored as a list of rows, where each row holds a node's key, its value and the row indices of its children. First you traverse one such tree, then you merge two of them by key. ...
Asked at:Hudson River Trading
More Hudson River Trading interview questions
- Count Fancy Numbersmedium
- Reversi Single Move Simulationmedium
- Implement itoa Functioneasy
- Guess Hidden Number IImedium
- Winner of a Dot Grid Gamemedium
OfferRetriever
Master technical interviews with real questions from top companies. Build your confidence and career.
LEGAL
© 2026 Purple Business Holdings LLC. All rights reserved. See Terms of Service.