21. Data Structures


In this chapter you’ll learn:

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

• How boxing and unboxing enable simple-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.

Much that I bound, I could not free; Much that I freed returned to me.

Lee Wilson Dodd

There is always room at the top.

Daniel Webster

I think that I shall never see A poem lovely as a tree.

Joyce Kilmer


21.1 Introduction

21.2 Simple-Type ...

Get C# 2010 for Programmers, Fourth Edition now with the O’Reilly learning platform.

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