Linked Lists In Data Structures - Study Mode
[#61] The algorithm given is for deleting an element in an unrolled linked list. What should be the correct statement for the blank given below? Find an element in node a
a.data.delete(element)
a.elementNum--
while a.elementNum < a.data.size / 2
put element from a.next.data in a.data
a.next.elementNum--
a.elementNum++
if a.next.elementNum < a.next.data.size / 2
_______________________
_______________________
Correct Answer
(A) merge nodes a and a.next
delete node a.next
[#62] The nodes in a skip list may have many forward references. their number is determined
Correct Answer
(A) probabilistically
[#63] What is a skip list?
Correct Answer
(B) a linkedlist that allows faster search within an ordered sequence
[#64] Which of the following is a drawback of an unrolled linked list?
Correct Answer
(C) High overhead per node
[#65] Which of the following is not the properties of XOR lists?
Correct Answer
(D) X⊕0 = 1