题目:请实现两个函数,分别用来序列化和反序列化二叉树
解析:首先存储二叉树的先序遍历,遇到null就添加”#,” 否则添加“值,”。构件二叉树的时候也是用先序遍历构件。
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
public class Solution {
public int index = -1;
String Serialize(TreeNode root) {
StringBuffer sb = new StringBuffer();
if(root == null){//遇到null节点就添加"#,"
sb.append("#,");
return sb.toString();
}
//添加根节点值
sb.append(root.val + ",");
//递归添加做孩子节点值
sb.append(Serialize(root.left));
sb.append(Serialize(root.right));
return sb.toString();
}
TreeNode Deserialize(String str) {
index++;
int len = str.length();
if(index >= len){
return null;
}
String[] strr = str.split(",");
TreeNode node = null;
if(!strr[index].equals("#")){//节点不是"#",意味着该节点不是null
//递归构建节点
node = new TreeNode(Integer.valueOf(strr[index]));
node.left = Deserialize(str);//递归创建left
node.right = Deserialize(str);递归创建right
}
return node;
}
}