Fundamentals of Data Structures in C

Ellis Horowitz; Sartaj Sahni; Susan Anderson-Freed

ISBN 10: 0716782502 / ISBN 13: 9780716782506

Published by W. H. Freeman, 1992

May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G0716782502I4N00

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.

Bibliographic Details

Title: Fundamentals of Data Structures in C
Publisher: W. H. Freeman
Publication Date: 1992
Binding: Hardcover
Condition: Very Good
Dust Jacket Condition: No Jacket