LeetCode 297. 二叉树的序列化与反序列化 (层序遍历 \ 字符串)

思路

1. 序列化：利用BFS层序遍历二叉树，节点与节点之间用 , 隔开；如果遇到空节点，则使用字母 X 代替，最终以字符串返回
2. 反序列化：将序列化串，根据 , 分隔并保存在一个队列中；同时创建一个树节点的队列用来遍历到每层节点；遍历过程中，每次取出根节点和它可能的左右节点，然后判断这两个左右节点是否为 X ，如果是，则跳过说明为空节点；如果不是则加入其对应左右节点处，并加入队列中。

代码实现(java)

/**
 * 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) {
        if(root == null) return "";

        StringBuilder sb = new StringBuilder();
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);

        while(queue.size() > 0) {
            TreeNode node = queue.poll();
            if(node == null) {
                sb.append("X").append(",");
                continue;
            }
            sb.append(node.val).append(",");
            queue.offer(node.left);
            queue.offer(node.right);
        }
        return sb.toString();
    }

    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        if(data == "") return null;

        Queue<String> nodeQueue = new LinkedList<>(Arrays.asList(data.split(",", -1)));
        Queue<TreeNode> rootQueue = new LinkedList<>();
        TreeNode root = new TreeNode(Integer.parseInt(nodeQueue.poll()));
        rootQueue.offer(root);

        while (!rootQueue.isEmpty()) {
            TreeNode rootN = rootQueue.poll();
            String left = nodeQueue.poll();
            String right = nodeQueue.poll();

            if (!"X".equals(left)) {
                rootN.left = new TreeNode(Integer.parseInt(left));
                rootQueue.offer(rootN.left);
            }
            if (!"X".equals(right)) {
                rootN.right = new TreeNode(Integer.parseInt(right));
                rootQueue.offer(rootN.right);
            }
        }
        return root;
    }
}

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

补充(前序方式序列化与反序列化)

public class Code02_SerializeAndReconstructTree {
    public static class Node {
        public int value;
        public Node left;
        public Node right;

        public Node(int data) {
            this.value = data;
        }
    }

    // 前序方式序列化
    public static Queue<String> preSerial(Node head) {
        Queue<String> ans = new LinkedList<>();
        pres(head, ans);
        return ans;
    }

    public static void pres(Node head, Queue<String> ans) {
        if ((head == null)) {
            ans.add(null);
        }
        ans.add(String.valueOf(head.value));
        pres(head.left, ans);
        pres(head.right, ans);
    }

    // 前序方式反序列化
    public static Node buildByPreQueue(Queue<String> prelist) {
        if (prelist == null || prelist.size() == 0) {
            return null;
        }
        return preb(prelist);
    }

    public static Node preb(Queue<String> prelist) {
        String value = prelist.poll();
        if (value == null) {
            return null;
        }
        
        Node head = new Node(Integer.valueOf(value));
        head.left = preb(prelist);
        head.right = preb(prelist);
        return head;
    }
}