(A) a pointer is maintained to store both next and previous nodes.
(B) two pointers are maintained to store next and previous nodes.
(C) a pointer to self is maintained for each node.
127. Which one of the below mentioned is linear data structure?
128. Which of the following types of expressions do not require precedence rules for evaluation?
(A) Create a node when free space pool is empty.
(B) Traverse the nodes when free space pool is empty.
(C) Create a node when linked list is empty.
130. Linked lists are not suitable data structures for which one of the following problems?