 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
In
what situations would the data being “stored” in
|
|
|
the
node...
|
|
|
|
– |
be
represented by an array of data?
|
|
|
|
struct tree_node {
|
|
|
|
data ** array;
|
|
|
|
– |
when
each node’s data is actually a list of items (a
|
|
|
|
general
purpose list, stack, queue, or other ordered list
|
|
|
|
representation),
but where the size and efficiency of this
|
|
|
data
structure is preferred over a LLL
|
|