331 Verify Preorder Serialization of a Binary Tree

1 题目

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:

Input: "9,3,4,#,#,1,#,#,2,#,6,#,#"
Output: true

Example 2:

Input: "1,#"
Output: false

Example 3:

Input: "9,#,#,1"
Output: false

2 尝试解

2.1 分析

当某一节点的左右子节点都是#时，该节点是叶子节点，可以将该节点及其左右子树等效为#，逐层向上等效化简，直到根节点也变成#，就是一个有效的前序遍历数。

2.2 代码

class Solution {
public:
    bool isValidSerialization(string preorder) {
        stack<string> saver;
        while(preorder.size()){
            int i = 0;
            while(preorder[i]!=',' && i < preorder.size()) i++;
            string token = preorder.substr(0,i);
            preorder = (i < preorder.size())?preorder.substr(i+1):"";
            if(saver.empty()||saver.top()!="#" || token != "#") saver.push(token);
            else{
                while(1){
                    if(saver.empty()) return false;
                    saver.pop();
                    if(saver.empty()) return false;
                    saver.pop();
                    if(saver.empty() || saver.top()!="#"){
                        saver.push("#");
                        break;
                    }
                }
            }
        }
        if(saver.top()=="#") saver.pop();
        return saver.empty();
    }
};

3 标准解

class Solution {
public:
    bool isValidSerialization(const string& preorder)
    {   
        int capacity = 1; 
        istringstream in(preorder);    
        string node; 
        while (getline(in, node, ','))
        {
            capacity -= 1;
            if (capacity < 0)
            {
                return false; 
            }
            if (node != "#")
            {   
                capacity += 2;
            }
        }    
        return capacity == 0; 
    }   
};