Preorder Traversal of a BST Problem Statement

Given an array PREORDER representing the preorder traversal of a Binary Search Tree (BST) with N nodes, construct the original BST.

Each element in the given array is distinct, and a valid BST can always be constructed from the preorder traversal.

Your task is to construct the BST and return its inorder traversal.

Example:

Input:
PREORDER = [20, 10, 5, 15, 13, 35, 30, 42]
Output:
5 10 13 15 20 30 35 42

Constraints:

  • 1 <= T <= 100 - Number of test cases
  • 1 <= N <= 5000 - Number of nodes in each BST
  • 0 <= data <= 10^5 - Each BST node's value
  • Time Limit: 1 sec

Note:

No need to print the results; implement the function to return the inorder traversal of the constructed BST for each test case.

Be the first one to answer
Select
Add answer anonymously...

Top Software Developer Interview Questions Asked at Myntra

Q. We are given an array asteroids of integers representing asteroids in a row. For...read more
Q. Given a string of parentheses, find the length of the longest valid (well-formed...read more
Q. Given a string, find the longest palindromic substring.
Software Developer Interview Questions
Stay ahead in your career. Get AmbitionBox app
play-icon
play-icon
qr-code
Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+

Reviews

10L+

Interviews

4 Cr+

Salaries

1.5 Cr+

Users

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2025 Info Edge (India) Ltd.

Follow Us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter
Profile Image
Hello, Guest
AmbitionBox Employee Choice Awards 2025
Winners announced!
awards-icon
Contribute to help millions!
Write a review
Write a review
Share interview
Share interview
Contribute salary
Contribute salary
Add office photos
Add office photos
Add office benefits
Add office benefits