000			01693 a2200241 4500
999			_c788 _d788
005			20200908143908.0
008			190125b ||||| |||| 00| 0 eng d
020			_a9788173716058
040			_c0
082			_a004.422 _bHOR
100			_aHorowitz, Ellis
245			_aFundamentals of data structures in C _cEllis Horowitz, Sartaj Sahni, Susan Anderson-Freed
250			_a2/e
260			_bUniversities Press _c2008 _aHyderabad
300			_axvii, 617p _c23cm
505			_tBASIC CONCEPTS _tARRAYS AND STRUCTURES _tSTACKS AND QUEUES _tLINKED LISTS _tTREES _tGRAPHS _tSORTING _tHASHING _tPRIORITY QUEUES _tEFFICIENT BINARY SEARCH TREES _tMULTI WAY SEARCH TREES _tDIGITAL SEARCH STRUCTURES
520			_a 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
650			_aC (Computer program language)
650			_aData structures (Computer science)
700			_aSartaj Sahni
700			_aSusan Anderson-Freed
942			_cBK _2ddc