剑指offer-序列化二叉树

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

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

}

}
*/
public class Solution {
String Serialize(TreeNode root) {
StringBuffer s = new StringBuffer();
if (root == null) {
s.append("#,");
return s.toString();
}
s.append(root.val + ",");
s.append(Serialize(root.left));
s.append(Serialize(root.right));
return s.toString();
}

int index = -1;
TreeNode Deserialize(String str) {
index++;
int len = str.length();
if (index >= len) {
return null;
}
String[] arr = str.split(",");
TreeNode node = null;
if (!arr[index].equals("#")) {
node = new TreeNode(Integer.valueOf(arr[index]));
node.left = Deserialize(str);
node.right = Deserialize(str);
}
return node;
}
}