Question: What are the conditions for an optimal binary search tree and what is its advantage?
Options
A : The tree should not be modified and you should know how often the keys are accessed, it improves the lookup cost
B : You should know the frequency of access of the keys, improves the lookup time
C : The tree can be modified and you should know the number of elements in the tree before hand, it improves the deletion time
D : The tree should be just modified and improves the lookup time
Previous ||
Data Structure Binary Search Tree more questions
In contrast stretching, if r1?r2 and s1?s2 then which of....
In contrast stretching, if r1=s1 and r2=s2 then which of....
Select the correct statement from the following options.
Insertion of negative feedback in control system affects:
The milk becomes the property of the buyer once?
Which of the following is incorrect about Hierarchical Clustering?
The output of latches will remain in set/reset untill ___________
Auxiliary views cannot be used for the determining _____________
Which of the following statement is true for osmotic pumps?
The realizable k-? model is based on ________
Data Structure Adjacency List more Online Exam Quiz
Data Structure Balanced Partition
Data Structure Binary Search Iterative
Data Structure Binary Tree Properties
Data Structure Binary Trees Array
Data Structure Binary Trees Linked Lists