Available question text
Design encode and decode functions that convert an N-ary tree to a binary tree and back, preserving node values and child order. The core challenge is representing an arbitrary number of children in binary form (commonly via the left-child/right-sibling mapping) so the transformation is reversible and efficient.
Related questions
Continue with questions that share topics or the same question type.
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Average of Levels in Binary Tree
Coding
- Balance a Binary Search Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 431. Encode N-ary Tree to Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source