SalePaperback
Fluid Mechanics (In SI Units) (7th ED)
₹1,780 ₹890
Save: 50%
EXPERT C PROGRAMMINGEXPERT C PROGRAMMING (1st ED)
₹599 ₹300
Save: 50%
Fundamentals Of Data Structures In C (2nd ED)
Publisher:
UNIVERSITIES PRESS
| Author:
Sahni Horowitz
| Language:
English
| Format:
Paperback
Publisher:
UNIVERSITIES PRESS
Author:
Sahni Horowitz
Language:
English
Format:
Paperback
₹625 ₹313
Save: 50%
In stock
Ships within:
1-4 Days
In stock
As good as new (Used)
☆ ☆ ☆ ☆ ☆
☆ ☆ ☆ ☆ ☆
Book Type | |
---|---|
Signs of Wear | |
Weak Binding | |
Pages |
Pages are crisp and clean |
Pen/Pencil Marks |
No pen or pencil marks |
ISBN:
Category: Computer Engineering/IT Engineering
Page Extent:
636
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.
Be the first to review “Fundamentals Of Data Structures In C (2nd ED)” Cancel reply
Description
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.
About Author
Reviews
There are no reviews yet.
Be the first to review “Fundamentals Of Data Structures In C (2nd ED)” Cancel reply
[wt-related-products product_id="test001"]
Related products
RELATED PRODUCTS
Cryptography and Network Security (2nd Impression 2006)
Save: 60%
Digital Communication Fundamentals And Applications (2nd Ed)
Save: 60%
Distributed Operating Systems Concept And Design (2004)
Save: 60%
Oracle Database 11G The Complete Reference (India Edition 13th 2014)
Save: 50%
Software Engineering A Practitioner’s Approach (7th Ed)
Save: 60%
Reviews
There are no reviews yet.