click below
click below
Normal Size Small Size show me how
Linked Lists
| Question | Answer |
|---|---|
| A ___________ is a list of items, called nodes, in which the order of the nodes is determined by the address, called a link, stored in each node. | linked list |
| The pointer to a linked list—that is, the pointer to the first node in the list—is stored in a separate location called the ___________. | head |
| A linked list is a ___________ data structure, it can increase or decrease in size. | dynamic |
| The length of a linked list is the ___________ of nodes in the list. | number |
| Item insertion and deletion from a linked list does not require ___________, only the pointers are adjusted. | data movement |
| A (single) linked list is traversed in only ___________ direction. | one |
| The search on a linked list is ___________. | sequential |
| The ___________ pointer of a linked list is always fixed, pointing to the first node in the list. | head |
| To traverse a linked list, the program must use a pointer initialized to the ___________ in the list, it finds this using the head node. | first node |
| In a ___________ linked list, every node has two links: one points to the next node and one points to the previous node. | doubly |
| A doubly linked list can be traversed in ___________ direction. | either |
| In a doubly linked list, item insertion and deletion require the adjustment of ___________ pointers in a node. | two |
| The first node in the list has a previous node that point to ___________. | null |
| The last node in the list has a next node that point to ___________. | null |
| A linked list in which the last node points to the first node is called a ___________ linked list. | circular |