判断字符串能否组成前序遍历的二叉树

/*
 * One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null node, we record using a sentinel value such as #.

     _9_
    /   \
   3     2
  / \   / \
 4   1  #  6
/ \ / \   / \
# # # #   # #
For example, the above binary tree can be serialized to the string "9,3,4,#,#,1,#,#,2,#,6,#,#", where # represents a null node.

Given a string of comma separated values, verify whether it is a correct preorder traversal serialization of a binary tree. Find an algorithm without reconstructing the tree.

Each comma separated value in the string must be either an integer or a character '#' representing null pointer.

You may assume that the input format is always valid, for example it could never contain two consecutive commas such as "1,,3".

Example 1:
"9,3,4,#,#,1,#,#,2,#,6,#,#"
Return true

Example 2:
"1,#"
Return false

Example 3:
"9,#,#,1"
Return false
 * */
public class Solution {

	public static void main(String[] args) {
		// TODO 自动生成的方法存根

	}
	//判断字符串能否建立一个前向遍历二叉树
	//定义一个dif=outdegree-indegree(出度-入度)
	//如果节点不为null，则会有一个入度，两个出度
	//如果为null，则只有一个入度
	//If a serialization is correct, diff should never be negative and diff will be zero when finished
	public boolean isValidSerialization(String preorder) {
        String[] strings = preorder.split(",");
        int dif = 1;
        for(String s : strings)
        {
        	dif--;
        	if(dif < 0)
        		return false;
        	if(!s.equals("#"))//not null
        		dif += 2;
        }
        return dif == 0;//结果必须也outdegree = indegree
    }
	
	//中序
	public boolean isValidSerialization_Inorder(String preorder) {
        String[] strings = preorder.split(",");
        int dif = 1;
        for(String s : strings)
        {
        	dif--;
        	if(!s.equals("#"))//not null
        		dif += 2;
        	if(dif > 1)
        		return false;
        }
        return dif == 0;//结果必须也outdegree = indegree
    }
}