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

Ellis Horowitz, Sartaj Sahni, Dinesh Mehta




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 has been updated to include the latest features of the C++ language. Features such as exceptions and templates are now incorporated throughout the text along with limited exposure to STL. Treatment of queues, iterators and dynamic hashing has been improved. The book now discusses topics such as secure hashing algorithms, weightbiased leftist trees, pairing heaps, symmetric minmax heaps, interval heaps, topdown splay trees, B+ trees and suffix trees. Redblack 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
  • 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






第1章 基本概念
第2章 數組
第3章 堆棧和隊列
第4章 鏈表
第5章 樹
第6章 圖
第7章 排序
第8章 哈希
第9章 優先隊列
第10章 高效二叉搜索樹
第11章 多路搜索樹
第12章 數字搜索結構