Fundamentals of Data Structures in C, 2/e (Paperback)

Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed




New Edition of the Classic Data Structures Text!
This new edition provides a comprehensive and technically rigorous introduction to data structures such as arrays, stacks, queues, linked lists, trees and graphs and techniques such as sorting hashing that form the basis of all software. In addition, this text presents advanced or specialized data structures such as priority queues, efficient binary search trees, multiway search trees and digital search structures. The book now discusses topics such as weight biased leftist trees, pairing heaps, symmetric minmax heaps, interval heaps, topdown splay trees, B+ trees and suffix trees. Red-black trees have been made more accessible. The section on multiway tries has been significantly expanded and discusses several trie variations and their application to Internet packet forwarding.

Table of Contents

Chapter 1. Basic Concepts

Chapter 2. Arrays & Structures

Chapter 3. Stacks and Queues

Chapter 4. Linked Lists

Chapter 5. Trees

Chapter 6. Graphs

Chapter 7. Sorting Chapter 8. Hashing

Chapter 9. Priority Queues

Chapter 10. Efficient Binary Search Trees

Chapter 11. Multiway Search Trees

Chapter 12. Digital Search Structures