※面试题37 序列化二叉树(java)(二叉树转数组，数组转二叉树)

请实现两个函数，分别用来序列化和反序列化二叉树。

示例: 

你可以将以下二叉树：

    1
   / \
  2   3
     / \
    4   5

序列化为 "[1,2,3,null,null,4,5]"
注意：本题与主站 297 题相同：https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree/

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/xu-lie-hua-er-cha-shu-lcof
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

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

    public StringBuilder rserialize(TreeNode root, StringBuilder sb){
        if(root == null) sb.append("null,");
        else {
            sb.append(root.val);
            sb.append(",");

            rserialize(root.left, sb);
            rserialize(root.right, sb);
        }
        return sb;
    }
    // Encodes a tree to a single string.
    public String serialize(TreeNode root) {
        return rserialize(root, new StringBuilder()).toString();
    }

    public TreeNode rdeserialize(ArrayList<String> list) {
        String s = list.remove(0);
        TreeNode root = null;
        if(!s.equals("null")){
            root = new TreeNode(Integer.parseInt(s));
            root.left = rdeserialize(list);
            root.right = rdeserialize(list);
        }
        return root;
    }
    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        String[] parts = data.split(",");
        ArrayList<String> list = new ArrayList<>(Arrays.asList(parts));
        return rdeserialize(list);
    }
}

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