Cover of Fundamentals of data structures in C

Fundamentals of data structures in C

Rating
3.50
2 ratings
Pages
635
5 editions
First published
1993
1 language

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

  • Format not known University Press 2008 617 pages English ISBN 9788173716058 Open Library
  • Format not known Silicon Press 2007 617 pages English ISBN 9780929306407 Open Library
  • Format not known W. H. Freeman 1995 653 pages English ISBN 9780716782926 Open Library
  • Format not known Computer Science Press 1995 653 pages English ISBN 9780716782926 Open Library
  • Format not known Computer Science Press 1993 585 pages English ISBN 9780716782506 Open Library

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

See it on Goodreads →

Read a sample, borrow it or see other editions → openlibrary.org