000			01860nam a22002777a 4500
001			049809
003			CLRC
005			20250213095955.0
008			250211b |||||||| |||| 00| 0 eng d
010			_a049809
020			_a9788173716058
040			_aSouthern Asian Bible College _cSouthern Asian Bible College
082			_22nd Editions _a005.73 H816F _bC.1
100			_aHorowitz, Ellis _913679
245			_aFundamentals of Data Structures in C ; GSC002257. GSC002258 / _cEllis, Horowitz, Sartaj Sahni and Susan Anderson-Freed / _hText/
260			_aIndia _bUniversities Press _c2007
300			_a617pgs (Inc Index) , : Pb
500			_aThe 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 Includes bibliographical references and index
650			_aComputer Science _98213
650			_aFundamentals - Data Sturctures in C _913680
650			_aBasic Concepts - Data Structures in C _913681
700			_aSahni, Sartaj _913682
700			_aSusan Anderson-Freed _913683
856			_uhttps://archive.org/details/fundamentalsofda0002edhoro_l1t6/page/n7/mode/2up
942			_2ddc _cGEN _n0
999			_c35110 _d35110