Fundamentals Of Data Structures In C(Pul)

Download or read book Fundamentals Of Data Structures In C(Pul) written by Horowitz Ellis Sahni Sartaj & Anderson-Freed Susan and published by . This book was released on 2008 with total page 664 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.