297. Serialize and Deserialize Binary Tree

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.

For example, you may serialize the following tree


/ \
2 3
/ \
4 5
as “[1,2,3,null,null,4,5]”, just the same as how LeetCode OJ serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.
Note: Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.

思路: in-order traversal 来做,先定义好null node为”#”跟delimiter为”,”. serialize过程就是in-order 遍历然后转换成String。 deserialize过程也是对转换的string先按照delimiter进行tokenize一下,把拿到的数组放到Queue里面,然后in-order进行建树,每次从queue里面poll拿到一个节点,查看是否是null node,如果是就返回null,否则就当做根节点,然后依次建该根节点的左子树跟右子树,最后返回的节点就是root.

 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
public class Codec {
    private final String emptyNode = "#";
    private final String delimiter = ",";

    // Encodes a tree to a single string.
    public String serialize(TreeNode root) {
        StringBuilder sb = new StringBuilder();
        serialize(root, sb);
        return sb.toString();

    public void serialize(TreeNode root, StringBuilder sb) {
        if (root == null) {
        } else {
            serialize(root.left, sb);
            serialize(root.right, sb);

    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        Deque<String> queue = new ArrayDeque<String>();
        Collections.addAll(queue, data.split(delimiter)); 
        TreeNode root = buildTree(queue);
        return root;

    public TreeNode buildTree(Deque<String> nodes) {
        if (nodes.isEmpty()) 
            return null;
        String node = nodes.poll();
        if (node.equals(emptyNode)) 
            return null;
        TreeNode root = new TreeNode(Integer.valueOf(node));
        root.left = buildTree(nodes);
        root.right = buildTree(nodes);
        return root;

// Your Codec object will be instantiated and called as such:
// Codec codec = new Codec();
// codec.deserialize(codec.serialize(root));

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s