000			01897nam a22002777a 4500
003			OSt
005			20260602151636.0
008			260602b |||||||| |||| 00| 0 eng d
020			_a9788173716058
041			_aeng
082			_a005.73 HOR-F
100			_aHorowitz, Ellis. _9882
245			_aFundamentals of data structures in C
250			_a2nd
260			_aHyderabad _bUniversities Press (India) Pvt. Ltd. _c2023
300			_axvii, 617p.
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.
520			_aIntroduces the fundamental concepts of data structures and their implementation using the C programming language. Covers arrays, linked lists, stacks, queues, trees, graphs, sorting and searching techniques, recursion, memory management, and algorithm analysis, providing a foundation for the design and development of efficient computer programs.
650			_aData structures _xComputer science _980977
650			_aC _xComputer program language _980978
650			_aProgramming language _980979
700			_aSahni, Sartaj. _919593
700			_aAnderson-Freed, Susan. _980980
942			_cBK
999			_c200017 _d200017