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

Time Complexity: Serialize and Deserialize Binary Tree

O(n)

Understanding Time Complexity

We want to understand how long it takes to convert a binary tree into a string and back.

How does the time needed grow as the tree gets bigger?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

void serialize(TreeNode* root, ostringstream &out) {
    if (!root) {
        out << "# ";
        return;
    }
    out << root->val << ' ';
    serialize(root->left, out);
    serialize(root->right, out);
}

TreeNode* deserialize(istringstream &in) {
    string val;
    in >> val;
    if (val == "#") return nullptr;
    TreeNode* node = new TreeNode(stoi(val));
    node->left = deserialize(in);
    node->right = deserialize(in);
    return node;
}
    

This code converts a binary tree to a string and back using preorder traversal with markers for null nodes.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

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

How Execution Grows With Input

As the number of nodes in the tree grows, the time to serialize and deserialize grows proportionally.

Input Size (n)	Approx. Operations
10	About 10 visits plus null markers
100	About 100 visits plus null markers
1000	About 1000 visits plus null markers

Pattern observation: The operations grow linearly with the number of nodes.

Final Time Complexity

Time Complexity: O(n)

This means the time to serialize or deserialize grows directly with the number of nodes in the tree.

Common Mistake

[X] Wrong: "Serialization takes constant time because it just converts to a string."

[OK] Correct: The code must visit every node to record its value or null marker, so time grows with tree size.

Interview Connect

Understanding this helps you explain how tree data can be saved and restored efficiently, a common real-world need.

Self-Check

"What if we used level-order traversal instead of preorder? 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. Find the height of the binary tree

B. Sort the binary tree nodes in ascending order

C. Delete all nodes of the binary tree

D. Convert a binary tree to a string and back to a binary 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 binary tree -> Option D

4. Quick Check:

   Serialize/Deserialize = Convert tree to/from string [OK]

Hint: Think of serialize as packing, deserialize as unpacking [OK]

Common Mistakes:

• Confusing serialization with sorting
• Thinking it deletes nodes
• Assuming it calculates tree height

2. Which of the following is a correct way to represent a null node during serialization of a binary tree in C++ using a single-character marker?

easy

A. "null"

B. "#"

C. 0

D. -1

Solution

1. Step 1: Identify common null markers

   In many serialization methods, a special character like '#' is used to mark null nodes to distinguish them from valid node values.

2. Step 2: Compare options

   "null" is a string but longer and less common; 0 and -1 can be valid node values, so they are ambiguous.

3. Final Answer:

   "#" -> Option B

4. Quick Check:

   Null node marker = "#" [OK]

Hint: Use a unique symbol like '#' for null nodes [OK]

Common Mistakes:

• Using 0 or -1 which can be valid node values
• Using the word "null" which is verbose
• Not marking null nodes at all

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

medium

A. 2 1 4 3 5

B. 1 2 3 4 5

C. 2 4 1 5 3

D. 3 2 1 5 4

Solution

1. Step 1: Reconstruct the tree from preorder

   Preorder: 1 (root), 2 (left child), # (left null), # (right null), 3 (right child), 4 (left child), #, #, 5 (right child), #, #.

2. Step 2: Draw the tree and find inorder

   Tree structure:
       1
     /     \
    2        3
             /  \
           4      5
   Inorder (left, root, right): 2 1 4 3 5

3. Final Answer:

   2 1 4 3 5 -> Option A

4. Quick Check:

   Inorder from tree = 2 1 4 3 5 [OK]

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

Common Mistakes:

• Mixing preorder and inorder sequences
• Ignoring null markers
• Incorrect tree reconstruction

4. Consider this C++ snippet for deserializing a binary tree from a vector of strings representing preorder traversal with '#' as null marker:

TreeNode* deserializeHelper(vector<string>& data, int& index) {
  if (index >= data.size() || data[index] == "#") {
    index++;
    return nullptr;
  }
  TreeNode* node = new TreeNode(stoi(data[index++]));
  node->left = deserializeHelper(data, index);
  node->right = deserializeHelper(data, index);
  return node;
}

What is the bug in this code?

medium

A. The stoi conversion can throw exception without try-catch

B. The index is incremented twice for null nodes causing skipping elements

C. The function does not handle empty input vector

D. The function does not assign right child correctly

Solution

1. Step 1: Identify the stoi vulnerability

   The code uses stoi(data[index++]) without validating that data[index] is a valid integer string. Malformed input (non-numeric other than '#') causes unhandled std::invalid_argument exception.

2. Step 2: Rule out other options

   Index increments once per token: for '#' via index++ in if; for values via index++ in stoi. Empty input handled by index >= data.size(). Right child assigned correctly.

3. Final Answer:

   The stoi conversion can throw exception without try-catch -> Option A

4. Quick Check:

   stoi requires valid numeric strings [OK]

Hint: Validate inputs before stoi to prevent exceptions [OK]

Common Mistakes:

• Assuming no index increment for null nodes
• Ignoring possible exceptions from stoi
• Thinking right child assignment is missing

5. You want to serialize a binary tree and then deserialize it back. However, your tree contains integer node values that can be negative, zero, or positive. Which approach ensures correct serialization and deserialization without ambiguity?

hard

A. Serialize only node values ignoring nulls, reconstruct tree by sorting

B. Use comma-separated values but skip null markers to reduce size

C. Use space-separated values with '#' for nulls and convert strings to int using stoi

D. Serialize using preorder but replace negative values with zero

Solution

1. Step 1: Consider node values including negatives and zero

   Using space-separated values with '#' for nulls preserves structure and allows negative values as strings can represent negatives.

2. Step 2: Evaluate other options

   Use comma-separated values but skip null markers to reduce size skips nulls, losing tree shape.
   Serialize only node values ignoring nulls, reconstruct tree by sorting ignores nulls and sorts, losing original structure.
   Serialize using preorder but replace negative values with zero replaces negatives with zero, losing data.

3. Final Answer:

   Use space-separated values with '#' for nulls and convert strings to int using stoi -> Option C

4. Quick Check:

   Preserve nulls and convert strings properly [OK]

Hint: Keep null markers and convert strings carefully [OK]

Common Mistakes:

• Skipping null markers losing tree shape
• Replacing negative values losing data
• Sorting nodes losing original tree