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:
• Form linked data structures using references, self-referential classes and recursion.
• Learn how boxing and unboxing enable simple-type values to be used where
objects are expected in a program.
• Create and manipulate dynamic data structures, such as linked lists, queues, stacks and binary trees.
• Learn various important applications of linked data structures.
• Create reusable data structures with classes, inheritance and composition.