序列化二叉树

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

/**
 * 序列化与反序列化二叉树
 * 
 * @author 过路的守望
 *
 */
public class SerializeTree {


    public String Serialize(TreeNode root){
        StringBuilder sb = new StringBuilder();
        if(root == null){
            sb.append("#"+"$");
        }else {
            sb.append(root.val+"$");
            sb.append(Serialize(root.left));
            sb.append(Serialize(root.right));
        }
        return sb.toString();
    }

    //记录序列化下标
    private int index = -1;
    public TreeNode Deserialize(String str){
        index++;
        //已全部序列化
        if(index>=str.length()){
            return null;
        }
        String[] nodes = str.split("\\$");
        TreeNode node = null;
        if(!nodes[index].equals("#")){
            node = new TreeNode(Integer.parseInt(nodes[index]));
            node.left = Deserialize(str);
            node.right = Deserialize(str);
        }
        return node;
    }


    /**
     * 节点类
     */
private static  class TreeNode {
        int val = 0;
        TreeNode left = null;
        TreeNode right = null;

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

        }

    }

}