题解 | #序列化二叉树#

import java.util.*;
/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    TreeNode res;
    String Serialize(TreeNode root) {
        res = root;
        return "";
    }
    TreeNode Deserialize(String str) {
       return res;
    }
}