Linked List
1. Pick one correct statement from the following?
2. What is the time complexity of searching for an element in a circular linked list?
3. Assuming memory is not a limitation which of the following linked list is the best for searching
4. Consider the following linked list: 2 -> 4 -> 7 -> 9 -> 10 -> 13. Their addresses are 2408, 2560, 1560, 5440, 3240, 3000. Head variable is pointing at 4 (the second node). What will be head -> next -> next -> value.
(Node has value and next. value stores the value and next stores the address of the next variable).
(Node has value and next. value stores the value and next stores the address of the next variable).
5. The first node of a linked list is at the location 2000. At which memory location will the second node be added to. Assume the nodes contain integers, each integer occupies a memory of 4 bits. And each pointer is 1 bit.