New
ML System Design & SQL tracks just landed
See what's new
×
Question Bank
Pricing
Blog
Forum
HOT
JobRadar
NEW
Referral
Description
Solution
Discussion
Submissions
Ask AI
Question Bank
LinkedIn
Coding Question
AI Insights
Quick Summary
Merge two n-ary trees by summing node values where both trees have a node.
Align and merge children lists by their original index during traversal.
Directly attach subtrees from either tree when positions do not overlap.
What This Tests
Recursive tree traversal
Handling variable-degree nodes
Index-based list synchronization
Base case management in recursion
Common Patterns
DFS/BFS
Collapse
Hint 1
Hint 2
What Interviewers May Ask Next
Ask AI Assistant
Ask AI Assistant
Ask me anything about this coding question!
Qwen
Qwen3.6-Flash
0/2000
Auto
Debug
Run
Submit
Stdout
-
