Much that I bound, I could not free; Much that I freed returned to me.
|--Lee Wilson Dodd|
There is always room at the top.
I think that I shall never see A poem lovely as a tree.
In this chapter you’ll learn:<objective>
To form linked data structures using references, self-referential classes and recursion.</objective> <objective>
How boxing and unboxing enable simple-type values to be used where
objects are expected in a program.
To create and manipulate dynamic data structures, such as linked lists, queues, stacks and binary trees.</objective> <objective>
Various important applications of linked data structures.</objective> ...