A list that has no nodes is called________.

Related Questions

• The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
• In a full binary tree if number of internal nodes is I, then number of nodes N are?
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• What differentiates a circular linked list from a normal linked list?
• Consider a small circular linked list. How to detect the presence of cycles in this list effectively?
• What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
• The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
• A _____________ list is a list where the last node contains null pointer.
• A linked list whose last node points back to the list node instead of containing the null pointer________.
• The _________ for a linked list is a pointer variable that locates the beginning of the list.