Serialize and Deserialize Binary Tree in DSA Rust - 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 a binary tree to a string
fn serialize(root: &Option>) -> String {
    fn helper(node: &Option>, s: &mut String) {
        match node {
            Some(n) => {
                s.push_str(&n.val.to_string());
                s.push(',');
                helper(&n.left, s);
                helper(&n.right, s);
            }
            None => s.push_str("#,")
        }
    }
    let mut result = String::new();
    helper(root, &mut result);
    result
}

// Deserialize a string back to a binary tree
fn deserialize(data: &mut std::str::Split) -> Option> {
    match data.next() {
        Some("#") => None,
        Some(val) => {
            let node = Box::new(TreeNode {
                val: val.parse().unwrap(),
                left: deserialize(data),
                right: deserialize(data),
            });
            Some(node)
        }
        None => None,
    }
}

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 traversal of each node in the tree.
• How many times: Once per node, visiting all nodes exactly one time.

How Execution Grows With Input

Each node is visited once during serialization and once during deserialization.

Input Size (n)	Approx. Operations
10	About 20 visits (10 nodes x 2)
100	About 200 visits
1000	About 2000 visits

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

Final Time Complexity

Time Complexity: O(n)

This means the time needed grows directly in proportion to the number of nodes in the tree.

Common Mistake

[X] Wrong: "Serialization or deserialization takes constant time because it just converts data once."

[OK] Correct: Each node must be visited and processed, so time grows with tree size, not fixed.

Interview Connect

Understanding this helps you explain how tree data can be saved and restored efficiently, a useful skill in many coding problems.

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 for a binary tree?

easy

A. Sort the binary tree nodes in ascending order

B. Delete all nodes from the binary tree

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

D. Count the number of leaf nodes in the 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 tree -> Option C

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 serialization deletes nodes
• Mixing serialization with counting nodes

2. Which of the following Rust function signatures correctly represents a serialize function for a binary tree node defined as Option?

easy

A. fn serialize(root: Option) -> String

B. fn serialize(root: &TreeNode) -> Vec<i32>

C. fn serialize(root: Box<TreeNode>) -> Option<String>

D. fn serialize(root: Option<TreeNode>) -> String

Solution

1. Step 1: Check parameter type

   The binary tree root is usually represented as Option in Rust to allow empty trees and ownership.

2. Step 2: Check return type

   Serialization returns a String representing the tree.

3. Final Answer:

   fn serialize(root: Option) -> String -> Option A

4. Quick Check:

   Serialize takes Option and returns String [OK]

Hint: Serialize takes Option, returns String [OK]

Common Mistakes:

• Using &TreeNode instead of Option
• Returning Vec<i32> instead of String
• Using Option<TreeNode> without Box

3. Given the following Rust code snippet for serialization using preorder traversal, what is the output string for the tree with root value 1, left child 2, and right child 3?

fn serialize(root: Option) -> String {
    fn helper(node: &Option, s: &mut String) {
        match node {
            Some(n) => {
                s.push_str(&n.val.to_string());
                s.push(',');
                helper(&n.left, s);
                helper(&n.right, s);
            }
            None => s.push_str("#,")
        }
    }
    let mut result = String::new();
    helper(&root, &mut result);
    result
}

medium

A. "1,2,3,#,#,#,#,"

B. "1,2,#,#,3,#,#,"

C. "1,#,2,#,3,#,#,"

D. "#,1,2,3,#,#,#,"

Solution

1. Step 1: Understand preorder traversal serialization

   The function visits root, then left subtree, then right subtree, adding values and '#' for nulls.

2. Step 2: Trace the tree nodes

   Root 1: add "1," Left child 2: add "2," Left of 2 is None: add "#," Right of 2 is None: add "#," Right child 3: add "3," Left of 3 is None: add "#," Right of 3 is None: add "#,"

3. Final Answer:

   "1,2,#,#,3,#,#," -> Option B

4. Quick Check:

   Preorder serialize = "1,2,#,#,3,#,#," [OK]

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

Common Mistakes:

• Forgetting to add '#' for null children
• Mixing preorder with inorder or postorder
• Missing commas between values

4. The following Rust deserialize function has a bug. What is the main issue?

fn deserialize(data: &str) -> Option {
    fn helper(vals: &mut std::str::Split<char>) -> Option {
        match vals.next() {
            Some("#") => None,
            Some(val) => {
                let node_val = val.parse().unwrap();
                Some(Box::new(TreeNode {
                    val: node_val,
                    left: helper(vals),
                    right: helper(vals),
                }))
            }
            None => None,
        }
    }
    helper(&mut data.split(","))
}

medium

A. The function does not consume all input values

B. The function does not handle None values correctly

C. The parse unwrap can panic if val is not a number or '#'

D. The split iterator includes an empty string at the end causing parse errors

Solution

1. Step 1: Analyze split behavior

   Splitting a string like "1,2,#,#,3,#,#," by ',' produces an extra empty string at the end.

2. Step 2: Understand impact on parsing

   The helper tries to parse this empty string as a number, causing a panic or error.

3. Final Answer:

   The split iterator includes an empty string at the end causing parse errors -> Option D

4. Quick Check:

   Trailing comma causes empty string in split [OK]

Hint: Trailing comma in split creates empty string; handle or trim [OK]

Common Mistakes:

• Ignoring trailing empty string from split
• Assuming parse unwrap is always safe
• Not checking for None before parsing

5. You want to serialize a binary tree and then deserialize it back. Which approach below ensures the deserialized tree is structurally identical to the original, even if node values can be negative or zero?

hard

A. Use preorder traversal with '#' for nulls and commas as separators

B. Use inorder traversal without null markers and space separators

C. Use postorder traversal with zero as null marker and no separators

D. Use level order traversal but skip null nodes in serialization

Solution

1. Step 1: Consider traversal and null markers

   Preorder traversal with explicit '#' markers for nulls preserves tree structure exactly.

2. Step 2: Consider node values and separators

   Using commas as separators avoids confusion with negative or zero values; zero cannot be used as null marker.

3. Step 3: Evaluate other options

   Inorder without nulls loses structure; postorder with zero marker confuses zero values; skipping nulls in level order loses position info.

4. Final Answer:

   Use preorder traversal with '#' for nulls and commas as separators -> Option A

5. Quick Check:

   Preorder + '#' + commas = exact tree [OK]

Hint: Preorder + '#' + commas preserves structure with any values [OK]

Common Mistakes:

• Using inorder without null markers loses structure
• Using zero as null marker confuses zero values
• Skipping nulls in level order loses node positions