| Binary Search Trees |
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | In
what situations would the data being |
|||||||||||
| “stored”
in the node... |
||||||||||||
| – | be
represented by a pointer to a LLL node? |
|||||||||||
| struct tree_node { |
||||||||||||
| LLL_node * head; |
||||||||||||
| – | when
each node’s data is actually a list of items |
|||||||||||
| (a
general purpose list, stack, queue, or other |
||||||||||||
| ordered
list representation) |
||||||||||||