Fundamentals of data structures in C

The Open Library:

The classic data structure textbook 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, it presents advanced of 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 min-max heaps, interval heaps, top-down 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 several trie variations and their application to Interner packet forwarding have been disused.

Search for “Fundamentals of data structures in C” downloads:

Visit our Downloads Search page to see if downloads are available.

Borrow "Fundamentals of data structures in C" Online:

Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.

• Is Online Borrowing Available: Yes
• Preview Status: borrow
• Check if available: The Open Library & The Internet Archive

Find “Fundamentals of data structures in C” in Libraries Near You:

Read or borrow “Fundamentals of data structures in C” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Fundamentals of data structures in C” at a library near you.