《leetcode》：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

    1
   / \
  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.

思路

serialize这个直接借用两个队列按层取出节点即可

deserialize这个直接按照逆过程组装即可

实现代码如下：

    public class Codec {
        // Encodes a tree to a single string.
        public String serialize(TreeNode root) {
            StringBuffer res = new StringBuffer();
            if(root==null){
                return res.toString();
            }
            //借用两个队列来按层取出节点，构成字符串
            Queue<TreeNode> q = new LinkedList<TreeNode>();
            Queue<TreeNode> q2 = new LinkedList<TreeNode>();
            q.add(root);
            res.append("[").append(root.val);
            while(!q.isEmpty()){
                while(!q.isEmpty()){
                    TreeNode node = q.poll();
                    if(node!=null){
                        q2.add(node.left);
                        q2.add(node.right);
                    }   
                }
                StringBuffer str = new StringBuffer();
                while(!q2.isEmpty()){
                    TreeNode node = q2.poll();
                    if(node!=null){
                        str.append(",").append(node.val);
                        q.add(node);
                    }
                    else{
                        str.append(",").append("null");
                    }
                }
                res.append(str);
            }
            res.append("]");

            return res.toString();
        }

        // Decodes your encoded data to tree.
        public TreeNode deserialize(String data) {      
            int dataLen = data.length();
            if(dataLen<=2){
                return null;
            }
            String[] vals = data.substring(1, dataLen-1).split(",");//去掉字符串左右两边的括号并根据分号将数据分开

            int len = vals.length;
            if(len==0){
                return null;
            }
            TreeNode[]  treeNodes = new TreeNode[len];
            //用来记录节点是第几个非空结点,从零开始
            int[] counts = new int[len];
            counts[0]=0;
            treeNodes[0] = new TreeNode(Integer.valueOf(vals[0]));
            for(int i=1;i<len;i++){
                if(vals[i].equals("null")){
                    treeNodes[i]=null;
                    counts[i]=counts[i-1];
                }
                else{
                    treeNodes[i]=new TreeNode(Integer.valueOf(vals[i]));

                    counts[i]=counts[i-1]+1;
                }
            }

            for(int i=0;i<len&&2*counts[i]+1<len;i++){
                if(treeNodes[i]!=null){
                    treeNodes[i].left = treeNodes[2*counts[i]+1];
                    if(2*counts[i]+2<len){//考虑可能最后一个节点只有左子树，没有右子树
                        treeNodes[i].right = treeNodes[2*counts[i]+2];
                    }

                }
            }
            return treeNodes[0];
        }  

        public static void main(String[] args){
            Codec c = new Codec();
            String str = "[1,2,3]";
            TreeNode root =c.deserialize(str);
            String res = c.serialize(root);
            System.out.println(res);
        }
    }