Chapter 12. C Data Structures
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:<objective>
To allocate and free memory dynamically for data objects.</objective> <objective>
To form linked data structures using pointers, selfreferential structures and recursion.</objective> <objective>
To create and manipulate linked lists, queues, stacks ...