剑指offer面试题63 序列化二叉树(java实现)

class TreeNode {
	int val = 0;
	TreeNode left = null;
	TreeNode right = null;

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

	}

}

public class Solution {

	private int index = -1;

	String Serialize(TreeNode root) {

		String s = "";
		if (root == null) {
			return "$";
		}

		StringBuffer stringBuffer = new StringBuffer();
		stringBuffer.append(String.valueOf(root.val) + ",");
		stringBuffer.append(Serialize(root.left) + ",");
		stringBuffer.append(Serialize(root.right));

		s = stringBuffer.toString();

		return s;

	}

	TreeNode Deserialize(String str) {

		index++;

		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;
	}
}