Answer to Question #205653 in Algorithms for Sundas Noreen

Question

You’re interviewing for your dream job at an ecological ethical tech company with healthy snacks. You already passed 28 stages of interviews, and your final interviewer asks you to design a binary search tree data structure that performs INSERT operations in O( √ log n) time using a comparison-based algorithm. Design such a data structure or prove that this is impossible.

Answer 1

Step 1: Take the elements input in an array.

Step 2: Create a Binary search tree by inserting data items from the array into the

binary search tree.

Step 3: Perform in-order traversal on the tree to get the elements in sorted order.