Abstract level

Implementation level

Application level

All of the above

**A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…****The complexity of linear search algorithm is****Which of the following is true about the characteristics of abstract data types? i) It exports a type.…****Which of the following data structure is not linear data structure?****Binary search algorithm can not be applied to****A data structure where elements can be added or removed at either end but not in the middle****The term push and pop is related to the****Which of the following is not the required condition for binary search algorithm?****Linked lists are best suited****The difference between linear array and a record is****Which data structure is used in breadth first search of a graph to hold nodes?****Which of the following data structure cant store the non-homogeneous data elements?****To represent hierarchical relationship between elements, Which data structure is suitable?****If the values of a variable in one module is indirectly changed by another module, this situation is…****Which of the following is not a limitation of binary search algorithm?****Two dimensional arrays are also called****Which of the following statement is true ?****In linear search algorithm the Worst case occurs when****A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…****The complexity of Bubble sort algorithm is****Which data structure allows deleting data elements from and inserting at rear?****The complexity of Binary search algorithm is****Which of the following data structure is non linear type?****Which of the following case does not exist in complexity theory****For an algorithm the complexity of the average case is****Each array declaration need not give, implicitly or explicitly, the information about****Which if the following is/are the levels of implementation of data structure****Which of the following statement is false?****When new data are to be inserted into a data structure, but there is no available space; this situation…****______ is very useful in situation when data have to stored and then retrieved in reverse order.**