search

SarthakKeshari / Java-Questions-and-Solutions

This repository aims to solve and create new problems from different spheres of coding. A path to help students to get access to solutions and discuss their doubts.
MIT License
46 stars 95 forks source link

Construct Binary Search Tree from Preorder Traversal #416

Closed satyam878 closed 2 years ago

satyam878 commented 2 years ago

Enter your question -

Given an array of integers preorder, which represents the preorder traversal of a BST (i.e., binary search tree), construct the tree and return its root.

It is guaranteed that there is always possible to find a binary search tree with the given requirements for the given test cases.

A binary search tree is a binary tree where for every node, any descendant of Node.left has a value strictly less than Node.val, and any descendant of Node.right has a value strictly greater than Node.val.

A preorder traversal of a binary tree displays the value of the node first, then traverses Node.left, then traverses Node.right.

Enter link to the question(if question belongs to any online platform) -

https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/

Tags for the question(eg - Array, Basic, Stack, etc.) -

Binary Search Tree, Stack, Binary Tree

satyam878 commented 2 years ago

Kindly assign me this task @SarthakKeshari

SarthakKeshari commented 2 years ago

@satyam878, Kindly add your solution to "leetcode" folder. Deadline - 13/10/2021