Shulou(Shulou.com)06/01 Report--

This article is about how to understand the post-traversal sequence of big data's binary search tree. The editor thinks it is very practical, so I share it with you. I hope you can learn something after reading this article. Let's take a look at it with the editor.

Enter an array of integers to determine whether the array is the post-traversal result of a binary search tree. If so, return true, otherwise return false. Assume that any two numbers in the input array are different from each other.

Refer to the following binary search tree:

five

/\

2 6

/\

1 3

Example 1:

Input: [1, 6, 3, 2, 5]

Output: false

Example 2:

Input: [1, 3, 2, 6, 5]

Output: true

Tip:

Array length

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.