Last in first out

First in last out

Last in last out

First in first out

**Each array declaration need not give, implicitly or explicitly, the information about****Which of the following statement is true ?****Which of the following data structure is non linear type?****Linked lists are best suited****The complexity of merge sort algorithm is****When determining the efficiency of algorithm, the space factor is measured by****The term push and pop is related to the****Which of the following data structure is linear type?****Which of the following case does not exist in complexity theory****Which of the following is two way list?****Identify the data structure which allows deletions at both ends of the list but insertion at only one…****A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…****Merge sort uses ?****Which of the following data structures are indexed structures?****A variable P is called pointer if****A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…****To represent hierarchical relationship between elements, Which data structure is suitable?****The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…****Linked list are not suitable data structure of which one of the following problems ?****Two dimensional arrays are also called****Which of the following data structure is not linear data structure?****……………. Is a pile in which items are added at one end and removed from…****Which of the following is not a limitation of binary search algorithm?****Which of the following is non-liner data structure?****Binary search algorithm can not be applied to****Which of the following data structure is linear data structure?****_____ is not the component of data structure.****Which data structure is used in breadth first search of a graph to hold nodes?****In linear search algorithm the Worst case occurs when****The complexity of linear search algorithm is**