LeetCode--297--hard--SerializeAndDeserializeBinaryTree

summary:

level order | BFS | queue

package myapp.kit.leetcode.top100liked;

import myapp.kit.leetcode.base.TreeNode;

import java.util.LinkedList;
import java.util.Queue;

/**
 *
 * 297
 * hard
 * https://leetcode.com/problems/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.
 *
 * Example:
 *
 * You may serialize the following tree:
 *
 *     1
 *    / \
 *   2   3
 *      / \
 *     4   5
 *
 * as "[1,2,3,null,null,4,5]"
 * Clarification: The above format is the same as how LeetCode 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.
 *
 *
 * @author huangdingsheng
 * @version 1.0, 2020/5/19
 */
public class SerializeAndDeserializeBinaryTree {

    // Encodes a tree to a single string.
    public String serialize(TreeNode root) {
        if (root == null) {
            return null;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        StringBuilder sb = new StringBuilder();
        while (!queue.isEmpty()) {
            int len = queue.size();
            for (int i = 0; i < len; i++) {
                TreeNode node = queue.poll();
                if (node == null) {
                    sb.append("null");
                    sb.append(",");
                    continue;
                }
                sb.append(node.val);
                sb.append(",");
                queue.add(node.left);
                queue.add(node.right);
            }
        }
        return sb.substring(0, sb.length() - 1);
    }

    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        if (data == null || data.length() == 1) {
            return null;
        }
        String[] arr = data.split(",");
        TreeNode node = new TreeNode(Integer.parseInt(arr[0]));
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(node);
        int idx = 0;
        while (!queue.isEmpty()) {
            int len = queue.size();
            for (int i = 0; i < len; i++) {
                TreeNode node1 = queue.poll();
                if (node1 == null) {
                    continue;
                }
                idx++;
                if (idx > arr.length - 1) {
                    break;
                }
                node1.left = arr[idx].equals("null") ? null : new TreeNode(Integer.parseInt(arr[idx]));
                if (idx > arr.length - 1) {
                    break;
                }
                idx++;
                node1.right = arr[idx].equals("null") ? null : new TreeNode(Integer.parseInt(arr[idx]));
                queue.add(node1.left);
                queue.add(node1.right);
            }
        }
        return node;
    }

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

}