| LLL Recursive Insert |
|
|
|
|
|
|
|
|
|
|
| • | Is
this approach more or less efficient? |
||||||||
| • | How
do the nodes get connected? |
||||||||
| • | Does
it handle the “special case” where head is |
||||||||
| null
to begin with? |
|||||||||
| • | Does
it ever dereference a null pointer? |
||||||||
| • | How
about copies being placed on the program |
||||||||
| stack?
How does this compare with the previous |
|||||||||
| recursive
solution? |
|||||||||