Leetcode 255. Verify Preorder Sequence in Binary Search Tree (Medium) (cpp)

最新推荐文章于 2024-05-09 00:54:03 发布

Niko_Ke

最新推荐文章于 2024-05-09 00:54:03 发布

阅读量472

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/Niko_Ke/article/details/53315693

C++ 同时被 3 个专栏收录

299 篇文章

订阅专栏

Leetcode C++

287 篇文章

订阅专栏

Leetcode Tree

48 篇文章

订阅专栏

本文介绍了一个中等难度的LeetCode题目：验证一个整数序列是否为二叉搜索树的正确前序遍历序列。文章提供了一种使用递归方法的C++解决方案，并考虑了每个节点的值相对于父节点的大小限制。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Leetcode 255. Verify Preorder Sequence in Binary Search Tree (Medium) (cpp)

Tag: Tree, Stack

Difficulty: Medium

/*

255. Verify Preorder Sequence in Binary Search Tree (Medium)

Given an array of numbers, verify whether it is the correct preorder traversal sequence of a binary search tree.

You may assume each number in the sequence is unique.

Follow up:
Could you do it using only constant space complexity?

*/
class Solution {
public:
	bool verifyPreorder(vector<int>& preorder) {
		int i = 0;
		verifyPreorder(preorder, i, INT_MIN, INT_MAX);
		return i >= preorder.size() ? true : false;
	}
private:
	void verifyPreorder(vector<int>& nums, int& i, int low, int high) {
		if (i >= nums.size() || nums[i] > high || nums[i] < low) return;
		int cur = nums[i++];
		verifyPreorder(nums, i, low, cur);
		verifyPreorder(nums, i, cur, high);
		return;
	}
};