230k views
5 votes
Suppose as a computer programmer, you have been assigned a task to develop a program to store the sorted data in ascending order. Initially you have used linked list data structure to store the data but search operation was time consuming then you decided to use BST (Binary Search Tree) but retrieval efficiency is not improved. In such situation, How can you improve the efficiency of search operation for BST? Justify your answer with solid reason.

User Joan
by
3.9k points

1 Answer

3 votes

Answer: i dont know but have an great day

Step-by-step explanation:

User Favonius
by
4.7k points