Thoughtspot | SDE | 9 November

thoughtspot · Question · Posted Mar 2020

Given a Singly Linked List which has data members sorted in ascending order. Construct a Balanced Binary Search Tree which has same data members as the given Linked List. Input: Linked List 1->2->3 Output: A Balanced BST 2 1 3

The full answer & interview discussion are available to premium members.