Fundamentals of Data Structures in C

Horowitz, Ellis, Anderson-Freed, Susan, Sahni, Sartaj

  • 4.12 out of 5 stars
    26 ratings by Goodreads
ISBN 10: 0716782502 ISBN 13: 9780716782506
Published by Worth Publishers, Incorporated, 1992
Used Hardcover

From Better World Books Ltd, Dunfermline, United Kingdom Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

AbeBooks Seller since October 13, 2008

This specific item is no longer available.

About this Item

Description:

Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Seller Inventory # GRP70764781

  • 4.12 out of 5 stars
    26 ratings by Goodreads

Report this item

Synopsis:

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 afull chapter on search structures and a discussion of advanced tree structures. Recent data structure innovations rarelv 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.

From the Inside Flap: 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.

"About this title" may belong to another edition of this title.

Bibliographic Details

Title: Fundamentals of Data Structures in C
Publisher: Worth Publishers, Incorporated
Publication Date: 1992
Binding: Hardcover
Condition: Good

Top Search Results from the AbeBooks Marketplace