61. What happens if a node cannot fit an element in an unrolled linked list?
62. Unrolled linked-list requires more storage space for pointers compared to a singly linked list.
63. What datastructures can be used in implementing a free list?
64. Consider the 2-level skip list
How to access 38?
How to access 38?
65. To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?
66. The worst case running time of a linear search on the self organizing list is . . . . . . . .
67. Is a skip list like balanced tree?
68. For which of the following purpose a top pointer can be used?
69. What's wrong with this code which returns xor of two nodes address?
//struct is common userdefined datatype in c/c++ and class is it's alternative
struct node* XOR (struct node *a, struct node *b)
{
//this logic is used to fill the nodes with address of a xor linked list
return ((int) (a) ^ (int) (b));
}
//struct is common userdefined datatype in c/c++ and class is it's alternative
struct node* XOR (struct node *a, struct node *b)
{
//this logic is used to fill the nodes with address of a xor linked list
return ((int) (a) ^ (int) (b));
}70. Suppose, in a triply linked list, the elements 2, 3, 3, 5, 5, 5 and 6 are inserted in the given sequence. To which of the following elements will the top pointer point, if the linked list is traversed starting from the head?
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.