Serialize and deserialize binary tree - rFronteddu/general_wiki GitHub Wiki

Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.

Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.

Clarification: The input/output format is the same as how LeetCode serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.

public class Codec {

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

    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        String[] dataArray = data.split(",");
        Queue<String> q = new LinkedList<>();
        for (var s : dataArray) {
            q.offer(s);
        }
        
        return buildTree(q);
    }
    
    TreeNode buildTree(Queue<String> q) {
        String val = q.poll();
        if (val.equals("#")) {
            return null;
        }
        
        var node = new TreeNode(Integer.parseInt(val));
        node.left = buildTree(q);
        node.right = buildTree(q);
        return node;
    }
}
⚠️ **GitHub.com Fallback** ⚠️