www.gibmonks.com

Main Page




Previous Page
Next Page

[Page 998]

Chapter 21. 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'll turn over a new leaf.

Miguel de Cervantes

OBJECTIVES

In this chapter you will learn:

  • To form linked data structures using pointers, self-referential classes and recursion.

  • To create and manipulate dynamic data structures such as linked lists, queues, stacks and binary trees.

  • To use binary search trees for high-speed searching and sorting.

  • To understand various important applications of linked data structures.

  • To understand how to create reusable data structures with class templates, inheritance and composition.


[Page 999]

Outline

21.1 Introduction

21.2 Self-Referential Classes

21.3 Dynamic Memory Allocation and Data Structures

21.4 Linked Lists

21.5 Stacks

21.6 Queues

21.7 Trees

21.8 Wrap-Up

Summary

Terminology

Self-Review Exercises

Answers to Self-Review Exercises

Exercises

Special SectionBuilding Your Own Compiler


Previous Page
Next Page