Serialize and Deserialize Binary Tree in DSA Python - Time & Space Complexity

Time Complexity: Serialize and Deserialize Binary Tree

O(n)

Understanding Time Complexity

We want to understand how the time needed to save and rebuild a binary tree changes as the tree grows.

How does the work increase when the tree has more nodes?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right


def serialize(root):
    result = []
    def dfs(node):
        if not node:
            result.append('#')
            return
        result.append(str(node.val))
        dfs(node.left)
        dfs(node.right)
    dfs(root)
    return ','.join(result)


def deserialize(data):
    vals = iter(data.split(','))
    def dfs():
        val = next(vals)
        if val == '#':
            return None
        node = TreeNode(int(val))
        node.left = dfs()
        node.right = dfs()
        return node
    return dfs()
    

This code saves a binary tree to a string and rebuilds it back from that string using depth-first search.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Recursive traversal of each node in the tree during serialization and deserialization.
• How many times: Each node is visited exactly once in both serialize and deserialize functions.

How Execution Grows With Input

As the number of nodes in the tree increases, the number of steps grows roughly the same way.

Input Size (n)	Approx. Operations
10	About 10 visits plus placeholders for null children
100	About 100 visits plus placeholders
1000	About 1000 visits plus placeholders

Pattern observation: The work grows linearly with the number of nodes in the tree.

Final Time Complexity

Time Complexity: O(n)

This means the time to save or rebuild the tree grows directly in proportion to the number of nodes.

Common Mistake

[X] Wrong: "Serialization or deserialization takes more than linear time because of string operations or recursion overhead."

[OK] Correct: Each node is processed once, and string joining or splitting is done efficiently, so the overall time stays proportional to the number of nodes.

Interview Connect

Understanding this helps you explain how tree data can be saved and restored efficiently, a common task in many applications.

Self-Check

"What if we used breadth-first search (level order) instead of depth-first search for serialization? How would the time complexity change?"

Practice

1. What is the main purpose of serialize and deserialize functions in the context of a binary tree?

easy

A. Delete all nodes in a binary tree

B. Sort the nodes of a binary tree

C. Calculate the height of a binary tree

D. Convert a binary tree to a string and back to a tree

Solution

1. Step 1: Understand serialization

   Serialization means converting a data structure like a binary tree into a string format that can be stored or transmitted.

2. Step 2: Understand deserialization

   Deserialization means converting the string back into the original binary tree structure.

3. Final Answer:

   Convert a binary tree to a string and back to a tree -> Option D

4. Quick Check:

   Serialize + Deserialize = Convert tree to string and back [OK]

Hint: Serialization means tree to string, deserialization reverses it [OK]

Common Mistakes:

• Confusing serialization with sorting
• Thinking it deletes nodes
• Mixing serialization with height calculation

2. Which of the following is the correct way to represent a null node during serialization in a binary tree using preorder traversal?

easy

A. Use a special marker like '#' or 'null'

B. Skip the null node completely

C. Use an empty string ''

D. Use the value 0

Solution

1. Step 1: Understand null node representation

   During serialization, null nodes must be marked explicitly to preserve tree structure.

2. Step 2: Choose correct marker

   Common practice is to use a special marker like '#' or 'null' to represent null nodes.

3. Final Answer:

   Use a special marker like '#' or 'null' -> Option A

4. Quick Check:

   Null nodes marked with '#' or 'null' [OK]

Hint: Mark null nodes explicitly with '#' or 'null' [OK]

Common Mistakes:

• Skipping null nodes loses tree shape
• Using empty string confuses parsing
• Using 0 can be mistaken for a valid node

3. Given the following serialized string of a binary tree using preorder with '#' as null marker: 1,2,#,#,3,4,#,#,5,#,#, what is the inorder traversal of the deserialized tree?

medium

A. [2, 4, 1, 3, 5]

B. [1, 2, 3, 4, 5]

C. [2, 1, 4, 3, 5]

D. [1, 3, 2, 4, 5]

Solution

1. Step 1: Reconstruct the tree from serialization

   The string represents preorder: root=1, left=2, left's children null, right=3, left=4, right=5.

2. Step 2: Perform inorder traversal (left, root, right)

   Inorder: left subtree (2), root (1), left subtree of right child (4), root of right child (3), right subtree (5) -> [2, 1, 4, 3, 5]

3. Final Answer:

   [2, 1, 4, 3, 5] -> Option C

4. Quick Check:

   Inorder of deserialized tree = [2, 1, 4, 3, 5] [OK]

Hint: Draw tree from preorder, then do inorder traversal [OK]

Common Mistakes:

• Mixing preorder and inorder orders
• Ignoring null markers during reconstruction
• Swapping left and right children

4. Consider this buggy deserialize function snippet for a binary tree serialized with preorder and '#' as null marker:

def deserialize(data):
    def helper():
        val = next(vals)
        if val == '#':
            return None
        node = TreeNode(int(val))
        node.left = helper()
        node.right = helper()
        return node
    vals = iter(data.split(','))
    return helper()

What is the likely cause of a StopIteration error during deserialization?

medium

A. The helper function does not return the root node

B. The input string is missing some null markers

C. The split method is used incorrectly

D. The TreeNode constructor is called with a string instead of int

Solution

1. Step 1: Understand StopIteration cause

   StopIteration occurs when iterator runs out of elements unexpectedly.

2. Step 2: Check input data correctness

   If null markers '#' are missing, helper calls next(vals) more times than available, causing StopIteration.

3. Final Answer:

   The input string is missing some null markers -> Option B

4. Quick Check:

   Missing '#' causes StopIteration [OK]

Hint: Check if all null nodes are marked to avoid StopIteration [OK]

Common Mistakes:

• Thinking helper must return root explicitly
• Blaming split method for StopIteration
• Confusing int conversion error with StopIteration

5. You want to serialize a binary tree and then deserialize it back. However, the tree can contain negative and zero values. Which serialization approach below correctly handles all integer values including zero and negative numbers without confusion?

hard

A. Serialize using preorder with comma-separated values and 'null' for null nodes

B. Serialize using comma-separated values but skip null nodes

C. Serialize using preorder with space-separated values and '#' for null nodes

D. Serialize using preorder with comma-separated values and '0' for null nodes

Solution

1. Step 1: Identify safe null marker

   Using '0' as null marker is unsafe because zero can be a valid node value.

2. Step 2: Choose clear null marker and separator

   Using 'null' as null marker with comma separator clearly distinguishes null nodes and supports negative and zero values.

3. Final Answer:

   Serialize using preorder with comma-separated values and 'null' for null nodes -> Option A

4. Quick Check:

   'null' marker avoids confusion with zero or negative values [OK]

Hint: Use 'null' marker, not '0', to handle zero and negatives [OK]

Common Mistakes:

• Using '0' as null marker causes confusion
• Skipping null nodes loses tree shape
• Using space separator can cause parsing issues