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

Related Questions

• 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.
• 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 in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
• Each node in a linked list has two pairs of ………….. and ……………….
• A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
• A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
• if there are no nodes in linked list then start pointer will point at which value?
• Minimum number of fields in each node of a doubly linked list is____
• 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.