剑指 Offer 37. 序列化二叉树

剑指 Offer 37. 序列化二叉树

 

【分析】可以通过先序遍历来实现序列化和反序列化，当先序遍历到null时加入一个“#”来表示树的结构，反序列化的过程中不断缩短队列即可。

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

    List<String> list = new ArrayList();

    public void dfs(TreeNode node){
        if(node == null) list.add("#");
        else{
            list.add(String.valueOf(node.val));
            dfs(node.left);
            dfs(node.right);
        }
    }

    // Encodes a tree to a single string.
    public String serialize(TreeNode root) {
        dfs(root);
        StringBuilder sb = new StringBuilder();
        for(int i = 0, n = list.size(); i < n; i++){
            if(i != 0) sb.append(',');
            sb.append(list.get(i));
        }
        return sb.toString();
    }

    public TreeNode desr(Deque<String> queue){
        String str = queue.poll();
        if(str.equals("#")) return null;
        TreeNode root = new TreeNode(Integer.parseInt(str));
        root.left = desr(queue);
        root.right = desr(queue);
        return root;
    }

    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        String[] strs = data.split(",");
        Deque<String> queue = new LinkedList();
        for(var str: strs) queue.offer(str);
        return desr(queue);
    }
}

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