Much that I bound, I could not free; Much that I freed returned to me. Lee Wilson Dodd
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
"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
There is always room at the top.
Daniel Webster
Push onkeep moving. Thomas Morton
Push onkeep moving.
Thomas Morton
I think that I shall never see A poem lovely as a tree. Joyce Kilmer
I think that I shall never see A poem lovely as a tree.
Joyce Kilmer
In this chapter you will learn:
To form linked data structures using references, self-referential classes and recursion.
How boxing and unboxing enable primitive-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 trees.
Various important applications of linked data structures.
To create reusable data structures with classes, inheritance and composition.
Outline
24.1 Introduction24.2 Primitive-Type Structures; Boxing and Unboxing24.3 Self-Referential Classes.24.4 Linked Lists.24.5 Stacks24.6 Queues24.7 Trees24.7.1 Binary Search Tree of Integer Values24.7.2 Binary Search Tree of IComparable Objects24.8 Wrap-Up
24.1 Introduction
24.2 Primitive-Type Structures; Boxing and Unboxing
24.3 Self-Referential Classes.
24.4 Linked Lists.
24.5 Stacks
24.6 Queues
24.7 Trees
24.7.1 Binary Search Tree of Integer Values24.7.2 Binary Search Tree of IComparable Objects
24.7.1 Binary Search Tree of Integer Values
24.7.2 Binary Search Tree of IComparable Objects
24.8 Wrap-Up
