COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Every node has a successor
|
|
|
Time complexity of inserting a new node at the head of the list is O(1)
|
|
|
Time complexity for deleting the last node is O(n)
|
|
|
We can traverse the whole circular linked list by starting from any point
|
Detailed explanation-1: -9. Which of the following is false about a circular linked list? Explanation: Time complexity of inserting a new node at the head of the list is O(n) because you have to traverse through the list to find the tail node.
Detailed explanation-2: -Circular Linked List Complexity. The insertion operations that do not require traversal have the time complexity of O(1) . And, an insertion that requires traversal has a time complexity of O(n) . The space complexity is O(1) .
Detailed explanation-3: -Answer: D) Explanation: Circular Linked List stores the pointer of the head node in the next pointer of the last node.
Detailed explanation-4: -Which of these is not an application of a linked list? Explanation: To implement file system, for separate chaining in hash-tables and to implement non-binary trees linked lists are used. Elements are accessed sequentially in linked list. Random access of elements is not an applications of linked list.