331. Verify Preorder Serialization of a Binary Tree

最新推荐文章于 2024-08-26 07:28:39 发布

MrOneside

最新推荐文章于 2024-08-26 07:28:39 发布

阅读量205

点赞数

分类专栏： leetcode 文章标签： java leetcode

本文链接：https://blog.csdn.net/riskys/article/details/55222753

版权

leetcode 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

问题链接：点击打开链接

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

利用一棵树结点的入度和出度和为0. 就是除了根结点,每一个结点都有一个入度, 非空结点有两个出度。这样在构造一棵树的时候任何时候都有出度 >= 入度, 因为只有在补充完所有的空结点之后入度和才等于出度.所以在任何时候只要入度 > 出度 , 就说明我们多补充了空结点, 因为空结点只有入度没有出度. 最后遍历完所有结点之后看入度和出度是否相等即可判读是否是一颗完整的序列.

public class Solution {
    public boolean isValidSerialization(String preorder) {
        String[] strs = preorder.split(",");
        int degree = -1;
        for(int i=0;i<=strs.length-1;i++) {
            degree ++;
            if(degree > 0) {
                return false;
            }
            if(!strs[i].equals("#")) {
                degree -= 2;
            }
        }
        
        return degree == 0;
    }
}