What is the primary advantage of a Singly Linked List over a contiguous Array?
A singly linked list grows dynamically and can insert a node after a known node in O(1) pointer-update time. Arrays provide O(1) indexed access, while linked-list access is sequential and node pointers add memory overhead.
In a Doubly Linked List, how many pointer fields are contained within each individual node structure?
Each node in a Doubly Linked List contains two pointer fields: 'next' (pointing to the succeeding node) and 'prev' (pointing to the preceding node), enabling bidirectional traversal.
What is the time complexity of deleting the last element (tail node) in a Singly Linked List without a tail pointer?
To delete the last node in a Singly Linked List, one must traverse from the head node to the second-to-last node (n-1 steps) to update its 'next' pointer to NULL, requiring O(n) time.
In a Circular Singly Linked List with a single 'head' pointer, what is the condition indicating that the list is empty?
An empty Circular Linked List is indicated when the head pointer itself is NULL. If head->next == head, the list contains exactly one node.
What is the worst-case time complexity for searching a key value in a Binary Search Tree (BST) with n nodes?
In the worst case (a skewed/degenerated BST that resembles a linked list), searching for a key requires visiting every node, resulting in O(n) time complexity.