Chapter 20. 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’ll 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 ...

Get C++ How to Program, Sixth Edition now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.