91. What does a xor linked list have?
92. Which of the following represents the space complexity for an unrolled linked list?
93. Free lists are used in
94. Insertion and deletion are much faster in an unrolled linked list than in a singly linked list.
95. Which of the following is not the rearranging method used to implement self-organizing lists?
96. Memory usage in triply linked list is higher than doubly linked list.
97. Which of the following is an advantage of XOR list?
98. Consider the following algorithm to insert an element in a triply linked list.
insertelement(data)
{
create a node with given data.
if the linked list is empty
{
_____________
_____________
}
if the given node is less than the head
{
link the nodes through address and adjust the tail
}
if the given node is not less than the head
{
if the given node is equal to the head
{
new node is inserted on top of the head
}
else
{
traverse the linked list to find an element greater than the node and insert in front of the node
}
}
}
Which of the following option is best suited to fill the blank?
insertelement(data)
{
create a node with given data.
if the linked list is empty
{
_____________
_____________
}
if the given node is less than the head
{
link the nodes through address and adjust the tail
}
if the given node is not less than the head
{
if the given node is equal to the head
{
new node is inserted on top of the head
}
else
{
traverse the linked list to find an element greater than the node and insert in front of the node
}
}
}Which of the following option is best suited to fill the blank?
99. What is indexed skip list?
100. A node will be rejected while inserting if the given node is already present in a triply linked list.
Read More Section(Linked Lists in Data Structures)
Each Section contains maximum 100 MCQs question on Linked Lists in Data Structures. To get more questions visit other sections.