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.