Merge Keyed N-Ary Trees
Company: LinkedIn
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: Merge two keyed N-ary trees into a fresh result while preserving the required child order and matching nodes only within the same parent. Account for unmatched branches, very deep inputs, immutability, complexity, and concurrent-merge follow-ups.