TY  - GEN
AU  - Horowitz,Ellis
AU  - Sahni,Sartaj
AU  - Anderson-Freed,Susan
TI  - Fundamentals of data structures in C
SN  - 9788173716058
U1  - 005.73  23rd 
PY  - 2023///
CY  - New Delhi
PB  - University Press
KW  - Computer Science
KW  - Data Structures
KW  - C
N1  - Includes bibliography and index; Chapter 1: Basic concepts -- Chapter 2: Arrays and structures -- Chapter 3: Stacks and queues -- Chapter 4: Linked lists -- Chapter 5: Trees -- Chapter 6: Graphs -- Chapter 7: Sorting -- Chapter 8: Hashing -- Chapter 9: Priority queues -- Chapter 10: Efficient binary search trees -- Chapter 11: Multiway search trees -- Chapter 12: Digital search structures
N2  - This 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
ER  -