Serialize and Deserialize Binary Tree in DSA Java - 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.

// Serialize: convert tree to string
public String serialize(TreeNode root) {
    if (root == null) return "#,";
    return root.val + "," + serialize(root.left) + serialize(root.right);
}

// Deserialize: convert string back to tree
public TreeNode deserialize(Queue<String> nodes) {
    String val = nodes.poll();
    if (val.equals("#")) return null;
    TreeNode node = new TreeNode(Integer.parseInt(val));
    node.left = deserialize(nodes);
    node.right = deserialize(nodes);
    return node;
}
    

This code turns a binary tree into a string using preorder traversal and then rebuilds it from that string.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Recursive calls visiting each node once in both serialize and deserialize.
• How many times: Each node is processed exactly once during serialization and once during deserialization.

How Execution Grows With Input

As the tree grows, the number of nodes increases, so the work grows with the number of nodes.

Input Size (n)	Approx. Operations
10	About 20 calls (10 nodes for serialize + 10 for deserialize)
100	About 200 calls
1000	About 2000 calls

Pattern observation: The total work grows roughly twice the number of nodes, so it grows linearly with input size.

Final Time Complexity

Time Complexity: O(n)

This means the time to serialize and deserialize grows directly in proportion to the number of nodes in the tree.

Common Mistake

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

[OK] Correct: Each node is visited once, and string concatenation or queue operations happen in constant time per node, so overall time stays linear.

Interview Connect

Understanding this linear time complexity helps you explain how your code scales with tree size, a key skill in interviews.

Self-Check

"What if we changed the traversal order from preorder to inorder for serialization? How would the time complexity change?"

Practice

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

easy

A. Delete all nodes in a binary tree

B. Sort the nodes of a binary tree in ascending order

C. Find 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 binary tree into a string format so it can be stored or sent easily.

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/from string [OK]

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

Common Mistakes:

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

2. Which of the following is the correct Java method signature for a serialize function that converts a binary tree to a string?

easy

A. public int serialize(TreeNode root)

B. public void serialize(TreeNode root)

C. public String serialize(TreeNode root)

D. public TreeNode serialize(String data)

Solution

1. Step 1: Identify return type for serialization

   Serialization converts a tree to a string, so the return type must be String.

2. Step 2: Check method parameters

   The method should take the root node of the tree as input, so parameter is TreeNode root.

3. Final Answer:

   public String serialize(TreeNode root) -> Option C

4. Quick Check:

   Serialize returns String from TreeNode [OK]

Hint: Serialize returns string, takes root node as input [OK]

Common Mistakes:

• Using void return type for serialize
• Confusing serialize with deserialize signature
• Returning int instead of String

3. Given the following code snippet for serialization using preorder traversal with '#' as null marker and ',' as separator, what is the output string for the tree below? Tree:

    1
   / \
  2   3
     / \
    4   5

Code snippet:

void serializeHelper(TreeNode root, StringBuilder sb) {
  if (root == null) {
    sb.append("#,");
    return;
  }
  sb.append(root.val).append(",");
  serializeHelper(root.left, sb);
  serializeHelper(root.right, sb);
}

medium

A. 1,2,#,#,3,4,#,#,5,#

B. 1,2,#,#,3,4,#,#,5,#,#,

C. 1,3,2,#,#,4,#,#,5,#,#,

D. 1,2,3,4,5,#,#,#,#,#,#,

Solution

1. Step 1: Perform preorder traversal with null markers

   Visit root: 1, then left subtree: 2, left null (#), right null (#), then right subtree: 3, left: 4, left null (#), right null (#), right: 5, left null (#), right null (#).

2. Step 2: Build string with commas and '#' for nulls

   Concatenate values and null markers with commas: "1,2,#,#,3,4,#,#,5,#,#,"

3. Final Answer:

   1,2,#,#,3,4,#,#,5,#,#, -> Option B

4. Quick Check:

   Preorder + nulls = 1,2,#,#,3,4,#,#,5,#,#, [OK]

Hint: Preorder serialize: root,left,right with '#' for null [OK]

Common Mistakes:

• Missing null markers (#)
• Wrong traversal order
• Omitting trailing commas

4. Identify the bug in the following deserialize method that reconstructs a binary tree from a serialized string using preorder traversal with '#' as null marker:

int index = 0;
TreeNode deserialize(String data) {
  String[] nodes = data.split(",");
  if (nodes[index].equals("#")) {
    index++;
    return null;
  }
  TreeNode root = new TreeNode(Integer.parseInt(nodes[index++]));
  root.left = deserialize(data);
  root.right = deserialize(data);
  return root;
}

medium

A. The index variable should be static or global to maintain state across recursive calls

B. The split method should use ";" instead of ","

C. The method should return a String instead of TreeNode

D. The base case should check for empty string instead of "#"

Solution

1. Step 1: Understand index usage in recursion

   The index variable tracks position in nodes array. It must keep its value across recursive calls to move forward correctly.

2. Step 2: Identify scope problem

   Here, index is a local variable inside the method, so it resets to 0 on each call, causing infinite recursion or wrong tree.

3. Final Answer:

   The index variable should be static or global to maintain state across recursive calls -> Option A

4. Quick Check:

   Index must persist across calls [OK]

Hint: Index must be shared across recursion, use class/global variable [OK]

Common Mistakes:

• Making index local causing reset each call
• Wrong delimiter in split
• Incorrect return type

5. You want to serialize a binary tree and then deserialize it back. However, your tree contains integer values that can be negative, zero, or positive. Which approach below correctly handles all integer values including negatives during serialization and deserialization?

hard

A. Use preorder traversal with ',' as separator and '#' for nulls; parse integers with Integer.parseInt during deserialization

B. Use inorder traversal without null markers; split by spaces; parse integers with Integer.parseInt

C. Use level order traversal but skip null nodes; separate values by commas; parse integers with Integer.parseInt

D. Serialize only positive values and ignore negatives; use preorder traversal

Solution

1. Step 1: Choose traversal and null markers

   Preorder traversal with '#' for nulls ensures structure is preserved, including negative and zero values.

2. Step 2: Parse integers correctly

   Integer.parseInt handles negative, zero, and positive integers correctly during deserialization.

3. Final Answer:

   Use preorder traversal with ',' as separator and '#' for nulls; parse integers with Integer.parseInt during deserialization -> Option A

4. Quick Check:

   Preorder + '#' + Integer.parseInt handles all integers [OK]

Hint: Use preorder + '#' + Integer.parseInt for all integer values [OK]

Common Mistakes:

• Skipping null markers causing wrong tree
• Ignoring negative values
• Using traversal without nulls losing structure