Rebuild Tree From Level Order | Dataford Interview Questions

Given an array representing level-order traversal, rebuild the original tree structure. Use null for missing children and preserve the input array's positions, including trailing null values, when serializing the rebuilt tree for verification. Implement rebuild_tree(values), which accepts a list of integers or null values and returns the reconstructed tree serialized in the same level-order shape.

Input and Output

The input is a list values. Return a list containing the rebuilt tree's values in level-order, with null placeholders preserved.

Constraints

0 <= len(values) <= 10^4
Each non-null value is an integer
The first non-null node is the root
Every non-null node has a valid non-null parent position

Function Signature

def rebuild_tree(values):

Your question is Rebuild Tree From Level Order. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Input and Output

The input is a list values. Return a list containing the rebuilt tree's values in level-order, with null placeholders preserved.

Constraints

0 <= len(values) <= 10^4
Each non-null value is an integer
The first non-null node is the root
Every non-null node has a valid non-null parent position

Function Signature

def rebuild_tree(values):

Your question is Rebuild Tree From Level Order. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.