| allocate
| A | the portion of memory in which dynamic data structures are stored
|
| circularly-linked list
| B | a linked list in which the last node's next pointer points back to the first node
|
| deallocate
| C | to reserve computer memory
|
| doubly-linked list
| D | a data structure that allows data to be stored in a list in which memory is assigned to your data as it is needed
|
| dynamic data structure
| E | a linked list in which each node has a pointer linking it to the next node and the previous node
|
| heap
| F | the operator (-» used to access individual members ofa dy- namically-allocated structure
|
| linked list
| G | the process of accessing (also called visiting) every node in a list or tree
|
| node
| H | a pointer variable with a value of zero
|
| null pointer
| I | a data structure that reserves memory as it is needed
|
| singly-linked list
| J | to return memory to the heap for use by other data
|
| static data structure
| K | a linked list in which the pointers link the nodes in only one direction
|
| structure pointer operator
| L | a data structure that occupies the same amount of memory every time the program is run
|
| traversing
| M | the structure that contains the data in a linked list or tree
|