Workspace

Problem workspace

3 day streakD

Serialize & Deserialize

HardTreesConstruction

The challenge

Encode a binary tree as text and decode it into the same values and shape.

Values are signed integers. The decoder expects a valid complete stream from this serializer; it does not validate untrusted input.

Example

The sparse example [1,null,2,3] encodes as 1,#,2,3,#,#,#. An empty tree encodes as #.

Use the walkthrough below to inspect the input and each state change.

See Serialize tree, step by step

Follow the branches. Watch the state change.

7 input nodesL = left · R = right
Inspect the input.Labels identify node objects; numbers are their values. Left and right child pointers define the tree. Node labels identify objects; numbers show their values. The pointer table below provides the same structure in text.LRLRLR2D4B6E8A · root10F12C14G
CurrentProcessedPending
View child pointers & node state
Node state · null means no child
NodeValueLeftRightState
A8BC—
B4DE—
C12FG—
D2nullnull—
E6nullnull—
F10nullnull—
G14nullnull—
Step 01 / 47

Inspect the input.

Labels identify node objects; numbers are their values. Left and right child pointers define the tree.

root = A:8
View original input

A:8 [L:B, R:C] · B:4 [L:D, R:E] · C:12 [L:F, R:G] · D:2 [L:null, R:null] · E:6 [L:null, R:null] · F:10 [L:null, R:null] · G:14 [L:null, R:null]

Node IDs stay distinct even when values repeat. Pointer mutations update the diagram; removed nodes remain in the state table for reference.

Put it into code

Preorder plus a marker for every null child uniquely determines shape.

Nodes store value, left, and right. C++ uses C++17 or later.

from collections import deque

class Node:
    def __init__(self, value, left=None, right=None):
        self.value = value
        self.left = left
        self.right = right

def serialize(root):
    tokens = []
    def write(node):
        if node is None:
            tokens.append("#")
            return
        tokens.append(str(node.value))
        write(node.left)
        write(node.right)
    write(root)
    return ",".join(tokens)

def deserialize(data):
    # Input must be a complete stream produced by serialize.
    tokens = iter(data.split(","))
    def read():
        token = next(tokens)
        if token == "#":
            return None
        node = Node(int(token))
        node.left = read()
        node.right = read()
        return node
    return read()

A good place to start

Explore a pattern

A little guidance

Start with a pattern, read through a problem, and mark it solved when the idea clicks. Save anything you want to revisit.

New tutorials are added one at a time. Your bookmarks and solved checkmarks stay in this browser.

Explore the roadmap