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:
“9,3,4,#,#,1,#,#,2,#,6,#,#”
Return true
Example 2:
“1,#”
Return false
Example 3:
“9,#,#,1”
Return false
2. 思路
2.1 使用栈时
- 处理时,将节点顺序入栈,当栈顶连续出现两个null节点(即’#’)时,将这两个null节点连同前一个非null节点(即他们的父节点)一起退栈,并放入一个null节点,表示当前子树已经处理完毕。
- 当处理完整个序列时,若栈里最终只有一个’#’元素,那么返回true,否则,返回false.]
2.2 不使用栈
- 观察发现树中只有两种节点,叶子节点和非叶子节点,其中叶子节点为空(出度数 - 入度数 = - 1), 而非叶子节点(出度数 - 入度数 = 1)。
- 所以遍历先序序列时,使用一个diff 变量记录 degree - ingree的数量,若序列为正确的先序序列,则diff变量在遍历中需一直为非负数(负数表示树出度比入度大,已无法添加新节点), 且最终为0。
3. 代码
class Solution {
public:
bool isValidSerialization(string preorder) {
istringstream iss(preorder);
string s;
int diff = 1;
while (getline(iss, s, ',')) {
if (--diff < 0) return false;
if (s != "#") diff += 2;
}
return diff == 0;
}
};