Horowitz, Ellis  <br/><br/>
Fundamentals of data structures in C 
Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed 
 - 2/e 
 - Hyderabad  Universities Press  2008 
 - xvii, 617p  23cm 
<br/><br/> BASIC CONCEPTS  ARRAYS AND STRUCTURES  STACKS AND QUEUES  LINKED LISTS  TREES  GRAPHS  SORTING  HASHING  PRIORITY QUEUES  EFFICIENT BINARY SEARCH TREES  MULTI WAY SEARCH TREES  DIGITAL SEARCH STRUCTURES 
<br/><br/> 	<br/>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 
<br/><br/><label>ISBN: </label>9788173716058 
<br/><br/><label>Subjects--Topical Terms: </label><br/>C (Computer program language) <br/>Data structures (Computer science) 
<br/><br/><label>Dewey Class. No.: </label>004.422   / HOR