In doubly linked lists, traversal can be performed?

Related Questions

• 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?
• In doubly linked lists
• Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
• Minimum number of fields in each node of a doubly linked list is____
• Linked lists are best suited
• Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: i. isEmpty (Q) — returns true if the queue is empty, false otherwise. ii. delete (Q) — deletes the element at the front of the queue and returns its value. iii. insert (Q, i) — inserts the integer i at the rear of the queue. Consider the following function: void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); insert(Q, i); } }What operation is performed by the above function f ?
• What differentiates a circular linked list from a normal linked list?
• In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
• To perform level-order traversal on a binary tree, which of the following data structure will be required?
• The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.