A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ___________.
Lemma tree Red-black tree AVL tree None of the above
Which of the following is not a limitation of binary search algorithm?
requirement of sorted array is expensive when a lot of insertion and deletions are needed must use a sorted array there must be a mechanism to access middle element directly binary search algorithm is not efficient when the data elements are more than 1000
For sorting a file of size n by straight selection sort, the number of comparisons made in the first pass is _________.
n - 1 n(n - 1)/2 n None of the above
Finding the location of the element with a given value is:
Graph Traversal Tree Search
Which if the following is/are the levels of implementation of data structure?
Implementation level Application level Abstract level All of the above
A _______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
stacks linked list queue linked list both a & b none of the above
Heap sort is found to be very efficient _________.
with regard to storage requirement regarding overheads involved in time consumption none of the above
The complexity of Bubble sort algorithm is _____________.
O(n log n) O(n2) O(n) O(log n)
_______ form of access is used to add and remove nodes from a queue.
FIFO, First In First Out LIFO,Last In First Out FIFO, First In First Out none of the above
In a balance binary tree the height of two sub trees of every node can not differ by more than _______________.
0 2 3 1
0 Comments