## Data Structures and Algorithm AnalysisThis revision of Weiss' best-seller provides a concise, complete and dynamic picture of many important data structures used in modern programming practice using Pascal. The new edition retains its focus on issues of performances and efficiency, with the emphasis on concepts rather than code.*Many new and innovative data structures have been added including Tries/patricia, k-d trees, min max heaps, red black trees and pairing heaps *Many diagrams and illustrations added to aid the reader's understanding of data structures |

### What people are saying - Write a review

#### LibraryThing Review

User Review - sloDavid - LibraryThingWow. This book really blew my mind. Has excellent chapters on trees, hashing and sorting. Still relevant, even in 2005. The concepts are useful regardless of the programming language--Weiss simply uses JAVA to implement the concepts. Read full review

#### LibraryThing Review

User Review - lovesasha - LibraryThingI read this book when I want to fall asleep. Sure, it's technically good information, but it's also mind-numbingly boring. Read full review

### Contents

Introduction | 1 |

Algorithm Analysis | 15 |

Lists Stacks and Queues | 41 |

Copyright | |

10 other sections not shown

### Other editions - View all

### Common terms and phrases

0(N logN amortized analysis array assume average avl tree B-tree begin binary heap binary search tree binomial queue binomial tree bins bound cell Chapter compute cost data structure DecreaseKey DeleteMin deletion depth-first search directed graph edge efficient elements ElementType empty example Exercise Fibonacci heap hash function hash table header heap order height implementation increment initially input insertion sort integer known left child leftist heap linear linked list logN loop merge mergesort minimum multiplications NilNode node NP-complete O(logN operations optimal path compression perform pivot pointer polynomial position priority queue problem procedure quicksort R. E. Tarjan random number rank recursive calls red black tree requires result right subtree root rotation routine sequence Shellsort shortest path shown in Figure shows simple skew heaps skip list smallest solution solve spanning tree splay trees stack strategy Suppose Swap theorem traversal vertex vertices