序列化二叉树

/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;

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

}

}
*/
import java.util.Queue;
import java.util.LinkedList;
public class Solution {

String Serialize(TreeNode root) {
if(root == null)
return "#!";
else{
String str=root.val + "!";
str+=Serialize(root.left);
str+=Serialize(root.right);
return str;
}
}
TreeNode Deserialize(String str) {
String[] array = str.split("!");
Queue<String> queue = new LinkedList<String>();
for(int i=0;i<array.length;i++){
queue.offer(array[i]);
}
return Deserializeing(queue);
}
TreeNode Deserializeing(Queue<String> queue){
String value = queue.poll();
if(value.equals("#"))
return null;
TreeNode tr = new TreeNode(Integer.valueOf(value));
tr.left = Deserializeing(queue);
tr.right = Deserializeing(queue);
return tr;
}
}