[Feature]: Add 255. Verify Preorder Sequence in Binary Search Tree solution

[sivaprasath2004]

Is there an existing issue for this?

• I have searched the existing issues

Feature Description

255. Verify Preorder Sequence in Binary Search Tree

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.

Consider the following binary search tree:

     5
    / \
   2   6
  / \
 1   3

Example 1:

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

Example 2:

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

Use Case

• please assign me..

Benefits

No response

Add ScreenShots

No response

Priority

High

Record

• I have read the Contributing Guidelines
• I'm a GSSOC'24 contributor
• I have starred the repository

[sivaprasath2004]

Hello @ajay-dhangar please assign me..

[github-actions]

Hi @sivaprasath2004! Thanks for opening this issue. We appreciate your contribution to this open-source project. Your input is valuable and we aim to respond or assign your issue as soon as possible. Thanks again!

[github-actions]

Hello @sivaprasath2004! Your issue #3921 has been closed. Thank you for your contribution!