Chapter 16. Data Structures: Lists, Stacks, and Queues


[Page 767]

OBJECTIVES

After studying this chapter, you will

  • Understand the concepts of a dynamic data structure and an Abstract Data Type (ADT).

  • Be able to create and use dynamic data structures such as linked lists and binary search trees.

  • Understand the stack, queue, set, and map ADTs.

  • Be able to use inheritance to define extensible data structures.

  • Know how to use the TreeSet, TreeMap, HashSet, and HashMap library classes.

  • Be able to use the Java generic type construct.

OUTLINE

16.1

Introduction

16.2

The Linked List Data Structure

16.3

Object-Oriented Design: The List Abstract Data Type (ADT)

16.4

The Stack ADT

16.5

The Queue ADT

 

The LISP Language

16.6

From the Java Library: The Java Collections Framework and Generic Types

16.7

Using the Set and Map interfaces

16.8

The Binary Search Tree Data Structure

 

Chapter Summary

 

Solutions to Self-Study Exercises

 

Exercises





Java, Java, Java(c) Object-Orienting Problem Solving
Java, Java, Java, Object-Oriented Problem Solving (3rd Edition)
ISBN: 0131474340
EAN: 2147483647
Year: 2005
Pages: 275

flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net