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

Ellis Horowitz, Sartaj Sahni, Dinesh Mehta

買這商品的人也買了...

商品描述

Description 

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

商品描述(中文翻譯)

描述

本新版提供了對數據結構(如數組、堆棧、隊列、鏈表、樹和圖)以及排序哈希等技術的全面且技術嚴謹的介紹,這些技術是所有軟件的基礎。此外,本書還介紹了高級或專門的數據結構,如優先隊列、高效二叉搜索樹、多路搜索樹和數字搜索結構。

本書已更新以包括C++語言的最新功能。文本中現在包含了異常和模板等功能,並有限地介紹了STL。隊列、迭代器和動態哈希的處理已得到改進。本書現在還討論了安全哈希算法、加權偏左樹、配對堆、對稱極小極大堆、區間堆、自上而下的伸展樹、B+樹和後綴樹。紅黑樹變得更易於理解。多路字典樹部分已大幅擴展,並討論了幾種字典樹變體及其在互聯網封包轉發中的應用。

目錄

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