0 votes 0 votes 1.Time complexity to construct a binary search tree of n distinct elements? 2.Meaning of Unique BST? 3.same 1 for but unique BST? 3.if either preorder or postorder is given time complexity to construct a unique BST? Raghav Khajuria asked Sep 20, 2018 Raghav Khajuria 520 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Raghav Khajuria commented Sep 20, 2018 reply Follow Share Yes...make last element as root then insert one by one from last-1 to 1... 0 votes 0 votes Raghav Khajuria commented Sep 20, 2018 reply Follow Share Yes...make last element as root then insert one by one from last-1 to 1... what i did.. 0 votes 0 votes Sayan Bose commented Sep 20, 2018 reply Follow Share Okay suppose you take last element from post-order as root. What about its left and right child ? How do you find out without inorder ? 0 votes 0 votes Please log in or register to add a comment.