tag

#n-ary-tree

3 pages tagged

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 431: Encode N-ary Tree to Binary Tree

Problem Restatement We need to design a way to convert an N-ary tree into a binary tree and then reconstruct the original N-ary tree. Two methods are required: Method Meaning encode(root) Convert an N-ary tree into a binary tree decode(root) Convert the binary tree back into the original N-ary tree The conversion must preserve the full tree structure. An N-ary tree node can have any number of children. A binary...
leetcode tree n-ary-tree binary-tree dfs encoding May 10, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 429: N-ary Tree Level Order Traversal

Problem Restatement We are given the root of an N-ary tree. We need to return the level order traversal of its node values. Level order traversal means: Visit all nodes on level 0 Then all nodes on level 1 Then all nodes on level 2 Continue until the tree is finished For each level, we store the node values in a separate list. The final answer is therefore a list...
leetcode tree n-ary-tree bfs queue level-order-traversal May 10, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 428: Serialize and Deserialize N-ary Tree

Problem Restatement We are given an N-ary tree. An N-ary tree is a rooted tree where each node can have zero or more children. We need to design two methods: Method Meaning serialize(root) Convert the tree into a string deserialize(data) Convert the string back into the original tree There is no required serialization format. We can choose any format as long as it can rebuild the same tree structure. The...
leetcode tree n-ary-tree dfs serialization recursion May 10, 2026