This book is the most concise text on data structures I've read. And yes I've read 'Introduction to Algorithms' [...]. I found it verbose, distractive and mostly missing the underlying simplicity of what a data structure really is.
Bras's book touches on all data structures including all variants of queues, stacks, heaps, balanced trees, segment trees, tries and hash tables. Oh...and best of all, all his chapters have working examples in c. Very legible, very simple to use, and brutally efficient. (He actually uses some clever memory management tricks to optimize all his programs)
If you don't believe me, look at the code samples freely viewable on his website.
Reading this book helped me master the data structures field once and for all.
If you are a computer scientist that wants to master data structures in a hands on way, OR get started with low latency C programming OR wants to do well in a rigorous technical interview (like AMZN, GOOG, FB, GS etc) you probably want to read this book. On the other hand, if you are just looking to graduate, this may not be something you can handle!

Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet or computer – no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera, scan the code below and download the Kindle app.
Image Unavailable
Image not available for
Colour:
Colour:
-
-
-
- To view this video, download
Advanced Data Structures Printed Access Code
Sorry, there was a problem loading this page.Try again.
鶹
' +
'' + decodeURIComponent(encodedIframeContent) + ''+'div>'+''+'body>');
doc.close();
}
}
this.iframeload = function () {
var iframe = document.getElementById(iframeId);
iframe.style.display = '';
setTimeout(function () {
setIframeHeight(initialResizeCallback);
}, 20);
}
function getDocHeight(doc) {
var contentDiv = doc.getElementById("iframeContent");
var docHeight = 0;
if(contentDiv){
docHeight = Math.max(
contentDiv.scrollHeight,
contentDiv.offsetHeight,
contentDiv.clientHeight
);
}
return docHeight;
}
function setIframeHeight(resizeCallback) {
var iframeDoc, iframe = document.getElementById(iframeId);
iframeDoc = ((iframe.contentWindow && iframe.contentWindow.document) || iframe.contentDocument);
if (iframeDoc) {
var h = getDocHeight(iframeDoc);
if (h && h != 0) {
iframe.style.height = parseInt(h) + 'px';
if(typeof resizeCallback == "function") {
resizeCallback(iframeId);
}
} else if (nTries < MAX_TRIES) {
nTries++;
setTimeout(function () {
setIframeHeight(resizeCallback);
}, 50);
}
}
}
this.resizeIframe = function(resizeCallback) {
nTries = 0;
setIframeHeight(resizeCallback);
}
}
return DynamicIframe;
});
- LanguageEnglish
- ISBN-100511800193
- ISBN-13978-0511800191
Product details
- Language : English
- ISBN-10 : 0511800193
- ISBN-13 : 978-0511800191
- Item weight : 222 g
- 鶹 Rank: #338 in Computer Algorithms
- Customer Reviews:
About the author
Follow authors to get new release updates, plus improved recommendations.

Discover more of the author’s books, see similar authors, read book recommendations and more.
Customer reviews
4 out of 5 stars
4 out of 5
29 global ratings
How are ratings calculated?
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on 鶹. It also analyzes reviews to verify trustworthiness.
Top reviews from Canada
There are 0 reviews and 2 ratings from Canada
Top reviews from other countries
- Adriana MoralesReviewed in Mexico on October 1, 2024
5.0 out of 5 stars Great reference
Verified PurchaseIf you're tired of those repetitive data structures references out there, you can really check out this, as the name suggests, these are advanced data structures so you must be familiar to the basics of data structures, the codes are in C, so also you must be familiar with C, it's great to understand pretty much of the theory behind these structures
- Dennis Blondell DeckerReviewed in the United Kingdom on May 4, 2013
4.0 out of 5 stars Advanced data structures and algorithms
Verified PurchaseYes, it is more advanced with amortization analysis, and a few other things thrown in, e.g. from functional programming, but you also get all those that your introduction book didn't have or went over quickly. This is a good 2nd book after an introductory book.
- 鶹 CustomerReviewed in India on April 5, 2016
5.0 out of 5 stars nice book for advanced ds
Verified Purchaseextremely helpful book for those who want to learn advanced ds in depth. however the code implementations in the book are in c/c++ . but that comes as an added advantage to those who are concerned about memory management. i would suggest this to anybody who is taking up an advanced course in ds or studying advanced topics such as suffix tree fibonacci heaps search trees segment treea fenwik tree etc.
- Monalisa and ArindamReviewed in India on February 3, 2019
3.0 out of 5 stars Useful but not very readable
Verified PurchaseContrary to what one of the reviews mentioned, this does not merely cover run of the mill data structures. But the code is in C with poor formatting and no highlight running through pages. And the explanation is not so great. In fact the language / grammar is broken in places. You need a study guide or several extra hours of effort to get through this book but it is not useless.