linear arrays

linked lists

both of above

none of above

**Merge sort uses ?****In linear search algorithm the Worst case occurs when****The term push and pop is related to the****The number of possible ordered trees with three nodes A,B,C is?****The elements of an array are stored successively in memory cells because****Which one of the following permutations can be obtained the output using stack assuming that the input…****Each array declaration need not give, implicitly or explicitly, the information about****The memory address of fifth element of an array can be calculated by the formula****Binary search algorithm can not be applied to****Which of the following is not the part of ADT description?****Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…****Linked list are not suitable data structure of which one of the following problems ?****______ is very useful in situation when data have to stored and then retrieved in reverse order.****The complexity of merge sort algorithm is****The operation of processing each element in the list is known as****A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…****Two dimensional arrays are also called****Which of the following statement is false?****When determining the efficiency of algorithm the time factor is measured by****Which of the following statement is true ?****Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…****When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return****Which of the following data structure is linear data structure?****A variable P is called pointer if****_______ level is where the model becomes compatible executable code****Arrays are best data structures****To represent hierarchical relationship between elements, Which data structure is suitable?****A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…****Finding the location of the element with a given value is:****A data structure where elements can be added or removed at either end but not in the middle**