LeetCode: 331. Verify Preorder Serialization of a Binary Tree

LeetCode: 331. 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:

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

Example 2:

Input: "1,#"
Output: false

Example 3:

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

解题思路 —— 深度优先搜索

模拟对原二叉树的深度优先搜索，如果遇到

1. 还未搜索完字符串就遍历完了
2. 已经搜索完但是字符串还没遍历完

则表示当前字符串是不能构成二叉树的前序遍历的

AC 代码

func dfs(preorder* string) bool {
    // 没有遇到叶子节点
    if len(*preorder) == 0 {
        return false
    }

    cur := (*preorder)[0]
    idx := strings.Index(*preorder, ",")
    if idx != -1 {
        *preorder = (*preorder)[idx+1:]
    } else {
        *preorder = ""
    }
    
    // 叶子节点
    if cur == '#' {
        return true
    }
    
    // 左孩子
    if dfs(preorder) == false {
        return false
    }
    
    // 右孩子
    return dfs(preorder)
    
}
func isValidSerialization(preorder string) bool {
    if len(preorder) == 0 {
        return true
    }
    if dfs(&preorder) == false {
        return false
    }
    
    if len(preorder) == 0 {
        return true
    } else {
        return false
    }
}