O'Reilly logo

C# 2010 for Programmers, Fourth Edition by Harvey M. Deitel, Paul J. Deitel

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

21. Data Structures

Objectives

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

Outline

21.1 Introduction

21.2 Simple-Type ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required