序列化二叉树

• 迭代法

public class Solution {
    public int index = -1;
    //序列化二叉树
    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();
  }
    //反序列化二叉树
    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("#")){
            node = new TreeNode(Integer.valueOf(strr[index]));
            node.left = Deserialize(str);
            node.right = Deserialize(str);
        }
            return node;
  }
}