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.’ | ||
--Lewis Carroll |
There is always room at the top. | ||
--Daniel Webster |
Push on — keep moving. | ||
--Thomas Morton |
I think that I shall never see A poem lovely as a tree. | ||
--Joyce Kilmer |
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 ...
Get C How to Program, Fifth Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.