Fundamentals of data structures in C
- Pages
- 635
- 5 editions
- First published
- 1993
- 1 language
Join or log in to shelve and rate Free, no password.
Overview
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.
Ratings & reviews
Log in to rate or review this book.
No written reviews yet.
Discussions
Talk about this book with other readers.
Log in to start a discussion.
No discussions yet.
Editions
Details & links
- First published
- 1993
- Pages
- 635
- Languages
- Available in 1 language
Where to buy this book: see “Buy this book”
More about this book
Read a sample, borrow it or see other editions → openlibrary.org