Leetcode二叉树的序列化和反序列化 java实现及解析

Leetcode二叉树的序列化和反序列化 java实现及解析

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.

其实就是利用层级遍历来把一颗二叉树转为字符串，再由字符串还原的过程。一看到层级遍历我们就知道肯定又是要使用BFS的了，序列化的过程还是比较容易的，但是反序列化就稍微需要一些技巧了，让我们看看怎么样用java来实现吧

class Solution{
	public String serialize(TreeNode root){
		if(root == null)return "[]";
		ArrayList<TreeNode> queue = new ArrayList<>();
		queue.add(root);
		for(int i = 0;i < queue.size();i++){
			TreeNode node = queue.get(i);
			if(node == null)continue;
			if(node.left != null)queue.add(node.left);
			if(node.right != null) queue.add(node.right);
		}
		while(queue.get(queue.size()-1) == null){
			queue.remove(queue.size()-1);
		}
		StringBuilder sb = new StringBuilder();
		sb.append("[");
		sb.append(queue.get(0));
		for(int i = 1; i < queue.size();i++){
			if(queue.get(i) == null){
				sb.append(",");
				sb.append("null");
			}else{
				sb.append(",");
				sb.append(queue.get(i).val);
			}
		}
		sb.append("]");
		return sb.toString();
	}
	public TreeNode deserialize(String s){
		if(data.equals("[]")) return null;
        String[] vals = data.substring(1,data.length()-1).split(",");
        ArrayList<TreeNode> queue = new ArrayList<>();
        TreeNode root = new TreeNode(Integer.parseInt(vals[0]));
        queue.add(root);
        int index = 0;
        boolean left = true; //用于判断当前节点是左子节点还是右子节点
        for(int i = 1; i < vals.length;i++){
        	if(!vals[i].equals("null")){
        		TreeNode node = new TreeNode(Integer.parseInt(vals[i]));
        		if(left){
					queue.get(index).left = node;
				}else{
					queue.get(index).right = node;
				}
        	}
        	if(!left) index++;
        	left = !left;
        }
        return root;
	}
}