COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
5
|
|
|
3
|
|
|
2
|
|
|
1
|
Detailed explanation-1: -A circular doubly linked list contains 2 NULL pointers.
Detailed explanation-2: -We don’t need to maintain two pointers for front and rear if we use circular linked list. We can maintain a pointer to the last inserted node and front can always be obtained as next of last. 3. Circular lists are useful in applications to repeatedly go around the list.
Detailed explanation-3: -The implementation of each dllist is as a circular doubly-linked list with a sentinel node. Each node has two pointers–a forward link (next) to the next node on the list, and a backward link (prev) to the previous node on the list.
Detailed explanation-4: -In a doubly linked circular linked list, each node has pointers that point to both the next node and the previous node.
Detailed explanation-5: -6.1. The prev method is easy. The only disadvantage of the doubly linked list as compared to the singly linked list is the additional space used. The doubly linked list requires two pointers per node, and so in the implementation presented it requires twice as much overhead as the singly linked list.