二叉树的序列化和反序列化

二叉树的序列化和反序列化

问题描述

设计一个算法，并编写代码来序列化和反序列化二叉树。将树写入一个文件被称
为“序列化”，读取文件后重建同样的二叉树被称为“反序列化”。   	
如何反序列化或序列	化二叉树是没有限制的，你只需要确保可以将二叉
树序列化为一个字符串，并且	可以将字符串反序列化为原来的树结构。

样例

样例1

输入：{3,9,20,#,#,15,7}
输出：{3,9,20,#,#,15,7}
解释：
二叉树 {3,9,20,#,#,15,7}，表示如下的树结构：
	  3
	 / \
	9  20
	  /  \
	 15   7
它将被序列化为 {3,9,20,#,#,15,7}

样例2

输入：{1,2,3}
输出：{1,2,3}
解释：
二叉树 {1,2,3}，表示如下的树结构：
   1
  / \
 2   3
它将被序列化为 {1,2,3}

代码

import java.util.ArrayList;

public class Serialize_and_Deserialize_Binary_Tree {
    class TreeNode {
        public int val;
        public TreeNode left, right;
        public TreeNode(int val) {
            this.val = val;
            this.left = this.right = null;
        }
    }

    /**
     * This method will be invoked first, you should design your own algorithm
     * to serialize a binary tree which denote by a root node to a string which
     * can be easily deserialized by your own "deserialize" method later.
     */
    public String serialize(TreeNode root) {
        // write your code here
        if (root == null)
            return "{}";
        ArrayList<TreeNode> queen = new ArrayList<TreeNode>();
        queen.add(root);
        for (int i = 0; i < queen.size(); i++) {
            if (queen.get(i) == null)
                continue;
            queen.add(queen.get(i).left);
            queen.add(queen.get(i).right);
        }
        while (queen.get(queen.size()-1) == null)
            queen.remove(queen.size()-1);
        StringBuilder sb = new StringBuilder();
        sb.append("{");
        sb.append(queen.get(0).val);
        int size = queen.size();
        for (int i = 1; i < size; i++) {
            if (queen.get(i) == null) {
                sb.append(",#");
            } else {
                sb.append(",");
                sb.append(queen.get(i).val);
            }
        }
        sb.append("}");
        return sb.toString();
    }

    /**
     * This method will be invoked second, the argument data is what exactly
     * you serialized at method "serialize", that means the data is not given by
     * system, it's given by your own serialize method. So the format of data is
     * designed by yourself, and deserialize it here as you serialize it in
     * "serialize" method.
     */
    public TreeNode deserialize(String data) {
        // write your code here
        if (data.equals("{}"))
            return null;
        String[] tmp = data.substring(1,data.length() - 1).split(",");
        int len = tmp.length;
        ArrayList<TreeNode> queen = new ArrayList<TreeNode>();
        TreeNode root = new TreeNode(Integer.parseInt(tmp[0]));
        queen.add(root);
        boolean isLeftChild = true;
        int index = 0;
        for (int i = 1; i < len; i++) {
            if (!tmp[i].equals("#")) {
                TreeNode val = new TreeNode(Integer.parseInt(tmp[i]));
                if (isLeftChild) {
                    queen.get(index).left = val;
                } else {
                    queen.get(index).right = val;
                }
                queen.add(val);
            }
            if (!isLeftChild) {
                index++;
            }
            isLeftChild = !isLeftChild;
        }
        return root;
    }

}