Fundamentals of Data Structures in C
Horowitz, Sahni, Anderson-Freed
Price
850
ISBN
9788173716058
Language
English
Pages
664
Format
Paperback
Dimensions
158 x 240 mm
Year of Publishing
2008
Territorial Rights
Restricted
Imprint
Universities Press
Catalogues

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.

Ellis Horowitz is Professor of Computer Science and Electrical Engineering at the University of Southern California. Dr Horowitz is the author of ten books and numerous journal articles and refereed conference proceedings. Sartaj Sahni is a Distinguished Professor and Chair of Computer and Information Sciences and Engineering at the University of Florida. Dr Sahni has published over 300 research papers and written 15 textbooks. Susan Anderson-Freed is a Professor of Computer Science at Illinois Wesleyan University. Her areas of expertise are database management system and web design and development.
Follow us on
Copyright © Orient BlackSwan. All rights reserved.