AVL tree

Red-black tree

Lemma tree

None of the above

**Which of the following is not the part of ADT description?****The memory address of fifth element of an array can be calculated by the formula****The elements of an array are stored successively in memory cells because****Two main measures for the efficiency of an algorithm are****Finding the location of the element with a given value is:****Which of the following data structure cant store the non-homogeneous data elements?****Which if the following is/are the levels of implementation of data structure****The number of possible ordered trees with three nodes A,B,C is?****The situation when in a linked list START=NULL is****The Average case occur in linear search algorithm****The complexity of merge sort algorithm is****______ is very useful in situation when data have to stored and then retrieved in reverse order.****Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…****When new data are to be inserted into a data structure, but there is no available space; this situation…****The complexity of linear search algorithm is****For an algorithm the complexity of the average case is****Merge sort uses ?****Which of the following data structure is non linear type?****When determining the efficiency of algorithm, the space factor is measured by****Linked lists are best suited****Which of the following data structure can't store the non-homogeneous data elements?****Which of the following is not the required condition for binary search algorithm?****The complexity of Binary search algorithm is****Each array declaration need not give, implicitly or explicitly, the information about****Herder node is used as sentinel in ____****Linked list are not suitable data structure of which one of the following problems ?****The operation of processing each element in the list is known as****_______ level is where the model becomes compatible executable code****When determining the efficiency of algorithm the time factor is measured by****Which of the following algorithm design technique is used in the quick sort algorithm?**