← Questions
Construct a BST from its preorder traversal
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given the preorder traversal of a binary search tree with distinct values, rebuild the tree and return its root. Aim for linear time.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding