Which of the following name does not relate to stacks?

Related Questions

• Which of the following name does not relate to stacks?
• Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
• A …………………… does not keep track of address of every element in the list.
• A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
• When does top value of the stack changes?
• Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
• Which of the following is not the part of ADT description?
• Which of the following is not the internal sort?
• Which of the following is not the type of queue?
• Which of the following data structure is not linear data structure?