Serialize and Deserialize Binary Tree & BST

eccozhou 發(fā)布于2019-08-14 17:11 / 3260人閱讀

摘要：思路理論上說所有遍歷的方法都可以。但是為了使和的過程都盡量最簡單，是不錯的選擇。用作為分隔符，來表示。復(fù)雜度代碼思路這道題和之前不同，一般的樹變成了，而且要求是。還是可以用，還是需要分隔符，但是就不需要保存了。

297. 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的過程都盡量最簡單，preorder是不錯的選擇。serialize的話，dfs比較好寫，deserialize的話preorder和bfs比較好寫。用“,”作為分隔符，“#”來表示null。例子里serialize之后結(jié)果就變成"1,2,3,#,#,4,5"。deserialize的時候用一個queue來保存string。

復(fù)雜度

Time: O(N), Space: O(N)

代碼

    // Encodes a tree to a single string.
    public String serialize(TreeNode root) {
        // base case
        if(root == null) return "";
        StringBuilder encoded = new StringBuilder();
        encode(root, encoded);
        return encoded.substring(1).toString();
    }
    
    private void encode(TreeNode root, StringBuilder sb) {
        if(root == null) {
            sb.append(",#");
            return;
        }
        sb.append(",").append(root.val);
        encode(root.left, sb);
        encode(root.right, sb);
    }

    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        // base case
        if(data.length() == 0) return null;
        Queue q = new LinkedList(Arrays.asList(data.split(",")));
        return decode(q);
    }
    
    private TreeNode decode(Queue q) {
        if(q.isEmpty()) return null;
        String cur = q.poll();
        if(cur.equals("#")) return null;
        TreeNode root = new TreeNode(Integer.valueOf(cur));
        root.left = decode(q);
        root.right = decode(q);
        return root;
    }

449. Serialize and Deserialize BST

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.

The encoded string should be as compact as possible.

Note: Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.

思路

這道題和之前不同，一般的樹變成了BST，而且要求是as compact as possible。還是可以用preorder，還是需要分隔符，但是null就不需要保存了。deserialize部分要變得復(fù)雜，left的值總是小于root的值，right的值總是大于root的值，根據(jù)這個每次recursion的時候把左邊的值都放到另一個queue里面，剩下的就是右邊的值。

復(fù)雜度

Time: O(N^2), Space: O(N)

代碼

    // Encodes a tree to a single string.
    public String serialize(TreeNode root) {
        // base case
        if(root == null) return "";
        StringBuilder encoded = new StringBuilder();
        encode(root, encoded);
        return encoded.substring(1).toString();
    }
    
    private void encode(TreeNode root, StringBuilder sb) {
        if(root == null) return;
        sb.append(",").append(root.val);
        encode(root.left, sb);
        encode(root.right, sb);
    }
    
    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        // base case
        if(data.length() == 0) return null;
        Queue q = new LinkedList();
        for(String s : data.split(",")) q.offer(Integer.valueOf(s));
        return decode(q);
    }
    
    private TreeNode decode(Queue q) {
        if(q.isEmpty()) return null;
        int cur = q.poll();
        TreeNode root = new TreeNode(cur);
        Queue left = new LinkedList(); 
        while(!q.isEmpty() && q.peek() < cur) left.offer(q.poll());
        root.left = decode(left);
        root.right = decode(q);
        return root;
    }