剑指offer-序列化二叉树

题目：请实现两个函数，分别用来序列化和反序列化二叉树

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

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

    }

}
*/
public class Solution {
   int index = -1;
	String Serialize(TreeNode root) {
        StringBuffer sBuffer = new StringBuffer();
        
        if(root==null){
        	sBuffer.append("#,");
        	
        	return sBuffer.toString();
        }
        
        sBuffer.append(root.val+",");
        sBuffer.append(Serialize(root.left));
        sBuffer.append(Serialize(root.right));
        return sBuffer.toString();
        
	}
	TreeNode Deserialize(String str) {
		index++;
		String[] strings = str.split(",");
		TreeNode node = null;
		if(!strings[index].equals("#")){
			node = new TreeNode(Integer.valueOf(strings[index]));
			node.left = Deserialize(str);
			node.right = Deserialize(str);
		}
		return node;
	       
	}
}