Data Structures and AlgorithmsThe authors' treatment of data structures in Data Structures and Algorithms is unified by an informal notion of "abstract data types," allowing readers to compare different implementations of the same concept. Algorithm design techniques are also stressed and basic algorithm analysis is covered. Most of the programs are written in Pascal. |
Contents
Design and Analysis of Algorithms | 1 |
Basic Data Types | 37 |
Trees | 75 |
Copyright | |
12 other sections not shown
Other editions - View all
Common terms and phrases
adjacency algorithm arcs array assume average becomes begin binary block bucket called cell Chapter character child color complete components compute connected consider consisting constant containing cost course data structure defined DELETE directed edges element empty equal example field Figure function give given graph hash header hold implementation indicating initial input INSERT integer label language least leaves length less linked matching memory merge move node Note operations parent Pascal pass path pointer position possible priority problem procedure queue record recursive represent representation requires result root running sequence shown in Fig shows solution solve sort space spanning stack steps stored Suppose takes tion tour tree true vertex vertices Write