000			01354nam a22002057a 4500
005			20251201162953.0
020			_a978-8173716058
082			_a005.73 HOR
100			_aEllis Horowitz _9163
100			_aSartaj Sahni _9470
100			_aSusan Anderson-Freed _91144
245			_aFundamentals of Data Structures in C_2nd Edition
250			_a2
260			_aUniversities Press _bTelangana _c2023
300			_a664 _bItem Weight ‏ : ‎ 920 g Dimensions ‏ : ‎ 20.3 x 25.4 x 4.7 cm
520			_aThis 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 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 discusses several trie variations and their application to Internet packet forwarding.
650			_aCSE _914
942			_cBK
999			_c38058 _d38058