A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

Related MCQs

• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as
• 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.
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• A linked list whose last node points back to the list node instead of containing the null pointer________.
• A ______________ list is a header list where the node points back to the header node.
• A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.
• Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?
• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
• A linear collection of data elements where the linear node is given by means of pointer is called?
• If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?