Data Structures and AlgorithmsThis book presents the data structures and algorithms that underpin much of today's computer programming. The basis of this book is the material contained in the first six chapters of our earlier work, The Design and Analysis of Computer Algorithms. We have expanded that coverage and have added material on algorithms for external storage and memory management. As a consequence, this book should be suitable as a text for a first course on data structures and algorithms. The only prerequisite we assume is familiarity with some high-level programming language such as Pascal. |
Contents
Design and Analysis of Algorithms | 1 |
Basic Data Types | 37 |
Trees | 75 |
Copyright | |
11 other sections not shown
Other editions - View all
Common terms and phrases
abstract data type adjacency list arcs array assume augmenting path available list average B-tree begin end binary search tree binary tree bucket buddy buffer bytes called cell celltype Chapter color component compute consider constant cost cursor cycle data structure defined DELETE DELETEMIN depth-first search dictionary digraph directed graph edges element elementtype empty blocks example field function hash table header implementation initial input INSERT insertion sort integer key value label leaf linked list loop main memory MAKENULL merge mergesort O(nē O(nlogn operations ordered tree parent partially ordered tree Pascal pivot pointer position preorder priority queue problem procedure quicksort recursive represent representation root runs of length Section sequence shortest path shown in Fig solution solve space spanning tree stack steps string subproblems subtree Suppose swap takes tion tour variable vertex vertices Write a program