Fundamentals of Data Structures in C, Second Edition

  • 10h 18m
  • Ellis Horowitz, Sartaj Sahni
  • Silicon Press
  • 2008

Designed to function as a textbook or as a professional reference, Fundamentals of Data Structures in C provides in-depth coverage of all aspects of data structure implementation in ANSI C. The book goes beyond the standard fare of stacks, queues, and lists to offer such features as a full chapter on search structures and a discussion of advanced tree structures. Recent data structure innovations rarely found in other texts are presented, including Fibonacci Heaps, Splay Trees, Red-Black Trees, 2-3 Trees, 2-3-4 Trees, Leftist Trees, Binokcal Heaps, Min-Max Heaps, and Deaps.

In this Book

  • Basic Concepts
  • Arrays and Structures
  • Stacks and Queues
  • Linked Lists
  • Trees
  • Graphs
  • Sorting
  • Hashing
  • Priority Queues
  • Efficient Binary Search Trees
  • Multiway Search Trees
  • Digital Search Structures
SHOW MORE
FREE ACCESS

YOU MIGHT ALSO LIKE

Book Advanced Data Structures and Algorithms: Learn How to Enhance Data Processing with More Complex and Advanced Data Structures
Journey C
Rating 2.3 of 3 users Rating 2.3 of 3 users (3)
Journey The Essential Data Structures and Algorithms in Python