Algorithms—297.Serialize and Deserialize Binary Tree

最新推荐文章于 2019-10-23 10:26:47 发布

原创最新推荐文章于 2019-10-23 10:26:47 发布 · 296 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种二叉树节点的序列化与反序列化方法，通过将二叉树转换为字符串形式存储，并能从该字符串重新构建原来的二叉树结构。文章详细解释了序列化和反序列化的具体实现过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

思路：根据条件描述

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Codec {

    // Encodes a tree to a single string.
    public String serialize(TreeNode root) {
        List<TreeNode> list=new ArrayList<TreeNode>();
        list.add(root);
        StringBuffer sb=new StringBuffer();
        while(list.size()!=0){
            for(int i=0;i<list.size();i++){
                TreeNode node=list.get(i);
                if(node==null){
                    sb.append("null,");
                }else{
                    sb.append(node.val);
                    sb.append(",");
                    list.add(node.left);
                    list.add(node.right);
                }
                list.remove(i);
                i--;
            }
        }
        String ans=sb.toString();
        return ans.substring(0,sb.length()-1);
    }

    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        String[] strs=data.split(",");
        if(strs[0].equals("null")){
            return null;
        }
        TreeNode ans=new TreeNode(Integer.parseInt(strs[0]));
        List<TreeNode> list=new ArrayList<TreeNode>();
        list.add(ans);
        int i=1;
        while(i<strs.length){
            List<TreeNode> sonList=new ArrayList<TreeNode>();
            for(TreeNode node:list){
                if(i>=strs.length){
                    return ans;
                }
                if(!strs[i].equals("null")){
                    TreeNode left=new TreeNode(Integer.parseInt(strs[i]));
                    node.left=left;
                    sonList.add(left);
                }
                i++;
                if(i>=strs.length){
                    return ans;
                }
                if(!strs[i].equals("null")){
                    TreeNode right=new TreeNode(Integer.parseInt(strs[i]));
                    node.right=right;
                    sonList.add(right);
                }
                i++;
                
            }
            list=sonList;
        }
        return ans;
    }
}

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