A list that has no nodes is called________.

Related MCQs

• 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 graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
• The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as
• In a full binary tree if number of internal nodes is I, then number of nodes N are?
• 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.
• if there are no nodes in linked list then start pointer will point at which value?
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• In ……………, search start at the beginning of the list and check every element in the list.