Ask Question
16 September, 07:03

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.

+2
Answers (1)
  1. 16 September, 07:09
    0
    Answer: i dont know but have an great day
Know the Answer?
Not Sure About the Answer?
Get an answer to your question ✅ “Suppose as a computer programmer, you have been assigned a task to develop a program to store the sorted data in ascending order. Initially ...” in 📙 Computers & Technology if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers