[Leetcode]Verify Preorder Serialization of a Binary Tree

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

Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

class Solution {
public:
    //12,#,#
    string getNextToken(int start,string str){
        int end = start;
        while(end <= str.size() && str[end] != ',')++end;
        return str.substr(start,end-start);
    }
    bool isValidSerialization(string preorder) {
         stack<string>stk;
         string token;
         for(int i = 0;i < preorder.size();i += 1+token.size()){
            token = getNextToken(i,preorder);
            if(token=="")break;
            if(token != ","){
                if(token != "#")stk.push(token);
                else{//#
                    while(stk.size() > 1 && stk.top()=="#"){
                        string c2 = stk.top();stk.pop();
                        string c1 = stk.top();stk.pop();
                        if(c1 == "#")return false;
                    }
                    stk.push("#");
                }
            }
         }
         return stk.size()==1 && stk.top()=="#";
    }
};