Đang chuẩn bị liên kết để tải về tài liệu:
Introduction to java programming: Chapter 20 - Lists, Stacks, Queues, Trees, and Heaps

Introduction to java programming: Chapter 20 - Lists, Stacks, Queues, Trees, and Heap's Objectives is to describe what a data structure is; explain the limitations of arrays; implement a dynamic list using an array; implement a dynamic list using a linked structure. | Chapter 20 Lists Stacks Queues Trees and Heaps Chapter 11 Object-Oriented Design Chapter 20 Lists Stacks Queues Trees and Heaps Chapter 21 Generics Chapter 22 Java Collections Framework Chapter 19 Recursion Chapter 23 Algorithm Efficiency and Sorting Liang Introduction to Java Programming Sixth Edition c 2005 Pearson Education Inc. All rights reserved. 0-13-148952-6 1 Objectives To describe what a data structure is 20.1 . To explain the limitations of arrays 20.1 . To implement a dynamic list using an array 20.2.1 . To implement a dynamic list using a linked structure 20.2.2 Optional . To implement a stack using an array list 20.3 . To implement a queue using a linked list 20.3 . To implement a binary search tree 20.4 . Liang Introduction to Java Programming Sixth Edition c 2005 Pearson Education Inc. All rights reserved. 0-13-148952-6 What is a Data Structure A data structure is a collection of data organized in some fashion. A data structure not only stores data but also supports the operations for manipulating data in the structure. For example an array is a data structure that holds a collection of data in sequential order. You can find the size of the array store retrieve and modify data in the array. Array is simple and easy to use but it has two limitations Liang Introduction to Java Programming Sixth Edition c 2005 Pearson Education Inc. All 3 rights reserved. .