………… is very useful in situation when data have to stored and then retrieved in reverse order.

Related MCQs

• Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
• Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
• The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?
• New data are to be inserted into a data structure, but there is no available space; this situation is usually called__________.
• The process of accessing data stored in a serial access memory is similar to manipulating data on a
• The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be
• ________ is the situation where data-structure is empty.
• A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
• The maximum number of nodes in a tree for which post-order and pre-order traversals may be equal is
• B-tree of order n is a order-n multiway tree in which each non-root node contains