Basics
This data structure stores elements using nodes connected by pointers.
What is a linked list?
A linked list that allows only forward traversal.
What is singly linked list?
Adding a node is called this operation.
What is insertion?
malloc() is used for this purpose.
What is dynamic memory allocation?
Time complexity of searching in linked list.
What is O(n)?
This part of a node stores the actual value.
What is data?
This list has both next and previous pointers.
What is doubly linked list?
Removing a node is called this.
What is deletion?
This symbol is used to access structure members via pointer.
What is -> ?
Linked lists avoid this problem seen in arrays.
What is fixed size limitation?
This pointer stores the address of the next node.
What is next pointer?
In this list, last node connects back to first node.
What is circular linked list?
Finding an element is called this.
What is searching?
first->next = NULL indicates this.
What is end of list?
This application uses linked list in LIFO order.
What is stack?
The first node of a linked list is called this.
What is head?
This linked list requires extra memory for backward traversal.
What is doubly linked list?
This operation prints all elements.
What is traversal/display?
A loop used to traverse until last node.
What is while(temp != NULL)?
This application uses FIFO with linked list.
What is queue?
The last node points to this value.
What is NULL?
A circular list can be this or doubly linked.
What is singly linked?
Insertion at beginning requires updating this pointer.
What is head?
Error in “if(first = NULL)” is this type
What is assignment instead of comparison?
Reversing a linked list changes direction of this.
What are pointers/links?