subject
Computers and Technology, 19.02.2020 20:39 jjxt126

To develop a program to store the sorted data in ascending order. Initially, I have used a linked list data structure to store the data but search operation was time-consuming then I decided to use BST (Binary Search Tree) but retrieval efficiency is not improved. In such a situation, How can I improve the efficiency of the search operation for BST? Justify the answer with solid reason.

ansver
Answers: 2

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 01:30
Someone wishes to run the software on another computer system that runs an operating system that does not support the software what can he do
Answers: 3
question
Computers and Technology, 23.06.2019 16:00
What is the biggest difference between section breaks and regular page breaks? section breaks are more difficult to add than page breaks. section breaks make it easier for you to view the document as an outline. section breaks allow you to have areas of the document with different formatting. section breaks are smaller than regular page breaks.
Answers: 2
question
Computers and Technology, 24.06.2019 13:00
Ais a built in formula in spread spread a is any math process such as addition or subtraction. options are function and operation
Answers: 1
question
Computers and Technology, 24.06.2019 18:30
What is the local portion of the e-mail address below? [email protected] a.) @ b.) biz c.) gumchewer d.) twrigley
Answers: 1
You know the right answer?
To develop a program to store the sorted data in ascending order. Initially, I have used a linked li...
Questions
question
Mathematics, 06.11.2020 05:00
question
Mathematics, 06.11.2020 05:00
Questions on the website: 13722363