Construct a BST from its preorder traversal
Given the preorder traversal of a binary search tree with distinct values, rebuild the tree and return its root. Aim for linear time.
MetaCodingNo answer yet. Write the first one; the best answer gets endorsed.