Red black trees have been made more accessible.
The book now discusses topics such as secure hashing algorithms, weightbiased leftist trees, pairing heaps, symmetric min max heaps, interval heaps, top-down splay trees, B+ trees and suffix trees. Treatment of queues, iterators and dynamic hashing has been improved. Features such as exceptions and templates are now incorporated throughout the text along with limited exposure to STL. The book has been updated to include the latest features of the C++ language. 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. 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.
The section on multiway tries has been significantly expanded and several trie variations and their application to Interner packet forwarding have been disused. Red-black trees have been made more accessible. 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. 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 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.
Red-black trees have been made more accessible.Īuthor: Horowitz Ellis Sahni Sartaj & Anderson-Freed Susan
0 kommentar(er)
