Much that I bound, I could not free; Much that I freed returned to me.
—Lee Wilson Dodd
‘Will you walk a little faster?’ said a whiting to a snail, ‘There’s a porpoise close behind us, and he’s treading on my tail.’
There is always room at the top.
Push on—keep moving.
I think that I shall never see A poem lovely as a tree.
In this chapter you will learn:
• To form linked data structures using references, self-referential classes and recursion.
• 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 ...