This HTML version of Think Data Structures is provided for convenience, but it is not the best format of the book. In particular, some of the symbols are not rendered correctly.

You might prefer to read the PDF version.

Or you can buy this book on Amazon.com.

Index

Ant, 0.1, 1.4, 2.3, 7.1, 8.3, 8.3, 9.2, 10.4, 11.1, 11.4, 12.4, 14.3, 15.5, 16.4, 17.2
API, 0.1
Apache Ant, 0.1
ArrayDeque, 6.7
ArrayList, 1, 1.1, 1.3, 3, 4.4, 9.1, 10.1
AVL tree, 13.6
add, 2.3, 3.2, 3.5, 3.5, 4.1, 4.3, 5.1, 5.3, 8.1, 8.3
amortized analysis, 3, 3.2, 11.2
analysis, 15.2, 15.3, 17.3, 17.7
analysis of algorithms, 1, 2, 9.3
and, 16.4
anonymous class, 4.3, 16.5
application programming interface, 0.1
average time, 3.2, 5.1
BST, 12.2, 17.5
BST property, 12.2, 13.4
balanced tree, 13.5
base case, 13.2, 13.4, 17.2
big O notation, 2.2
binary search tree, 1, 12.2, 17.5
boolean, 2.3
boolean search, 16.3
bounded heap, 17.5, 17.6
bubble sort, 17.4
Card, 16.5
Collections, 16.4
Comparable, 1.2, 1.2, 16.4
Comparator, 16.4, 16.5, 17.6
cache, 11.3, 17.7
call stack, 6.5
child node, 6.2
chooseMap, 10.1
choosing a data structure, 5.5
class diagram, 11.6
clear, 3.6, 11.3, 12.3
client, 14.2
clone, 0.1
code point, 10.2
compare, 16.5
compareTo, 1.2, 16.5
comparison sort, 17.3
constant time, 2, 2.1, 2.3, 3.1, 3.1, 3.2, 3.2, 3.3, 3.5, 3.6, 4.1, 4.1, 4.4, 4.4, 5.1, 5.2, 5.2, 5.3, 5.4, 5.5, 6.6, 9.3, 9.3, 11, 11.2, 11.2, 11.5, 11.5, 12.1, 12.3, 13.5, 14.4, 14.4, 15.2, 15.3, 16.1, 17.4, 17.5
constructor, 1.4, 2.3
contains, 8.1
containsKey, 9.2, 11.3, 12.4
containsValue, 10.4, 11.3, 12.4
crawl, 15.5
crawler, 1, 6.1, 14
DBMS, 14.1
Deque, 6, 6.6
DFS, 6.5, 7.2
DOM tree, 6.2, 8.2, 15.3
Document, 6.3
data structure selection, 5.5
data structures, 1
database, 14.1
depth-first search, 6.4, 7.2
deque, 6.6
difference, 16.3
divide-conquer-glue, 17
doubly-linked list, 5.4
Element, 6.3, 8.2, 16.1
Elements, 7.3
Entry, 9.1
element, 2.3, 6.2
encapsulate, 1.3
equals, 2.3, 3.1, 9.3, 10.2
exception, 3.1
external sorting, 17.5
FIFO, 6.6, 15.4
field, 14.4
findEntry, 9.2, 9.3
findNode, 12.4, 13.1
fork, 0.1
frequency, 8.1
Getting to Philosophy, 1, 6.1, 7, 7.4
Git, 0.1
GitHub, 0.1
Google, 17.4
garbage collection, 3.6
generic type, 1.2
get, 2.3, 3.1, 8.2, 8.3, 9.2, 9.3, 10.1, 10.1, 10.4, 11.3, 12.4, 13.5
getCounts, 15.1
getNode, 4.1
graph, 15.4
HAS-A relationship, 11.6
HashMap, 1, 8.2, 11, 15.3
Heroku, 16.6
HTML, 6.2
hash code, 9.3, 10.1, 10.3
hash function, 10.1
hash table, 1, 9
hashCode, 10.2
hashing, 10.1, 11.2
haystack, 9.3
heap, 17.5
heap property, 17.5
heap sort, 17.5, 17.5
height, 12.2, 12.4
helper class, 14.3, 15.5, 16.4
helper method, 2.3, 3.5, 4.1, 9.2, 10.1, 12.4, 12.4, 12.4, 14.5, 15.1
IDE, 1.4
Index, 8.3, 16.1
Integer, 1.2
IS-A relationship, 11.6
Iterable, 7.2
Iterator, 7.2
immutable, 10.3
implementation, 1.4
in-order, 6.5, 12.4, 13.4
index, 8
indexer, 1, 6.1, 14, 14
indexOf, 2.3, 3.1, 4.1
indexPage, 8.3
information retrieval, 1, 16.2
inheritance, 11.6
insertion sort, 17.1
inspecting the DOM, 6.2
instance variable, 2.3
instantiate, 1.3
interactive development environment, 1.4
interface, 0.1, 1.1, 1.4
interface-based programming, 1.3
intersection, 16.3
inverse document frequency, 16.4
isEmpty, 6.6, 7.2
iterative, 13.3
iterative DFS, 6.7
Java Collections Framework, 0.1
Java SDK, 0.1, 1.4
JCF, 0.1
Jedis, 14.2
JedisIndex, 14.3, 14.5, 15.1, 15.5
JedisMaker, 14.3, 15.5, 16.4
JSON, 14.1
JUnit, 0.1
jsoup, 6.2, 6.3
k largest elements, 17.6
key, 8.1, 12.2
key-value database, 14.1
key-value pair, 8.1, 12.3
keySet, 12.4, 13.4
LIFO, 6.6, 15.4
LinkedHashSet, 13.4
LinkedList, 1, 1.1, 1.3, 4.5, 5.2, 5.3, 5.4, 6.7, 16.1
List, 1, 1.1, 1.3, 17.1
ListClientExample, 1.3
ListNode, 3.4
ListSorter, 17.1, 17.2, 17.5
linear search, 13.5

linear time, 2, 2.1, 2.3, 3.1, 3.1, 3.2, 3.2, 3.2, 3.5, 3.6, 4.1, 4.1, 4.4, 4.4, 4.5, 5.1, 5.2, 5.3, 5.5, 9.3, 9.3, 10.1, 10.4, 11.2, 11.3, 11.5, 11.5, 12.1, 12.3, 13.2, 13.5, 15.2, 15.3, 17.1, 17.1, 17.3, 17.3, 17.4, 17.6
linearithmic, 17.5
linearithmic time, 17, 17.3
linked data structures, 3.4
linked list, 3.4
load factor, 11.1
log time, 12.2
log-log scale, 4.4
logarithm, 4.4, 12.2, 17.3
logarithmic time, 13.5, 13.5, 13.6, 17.5
lookup, 8.1
Map, 1, 8.2, 10.1, 12, 12.3
MyArrayList, 2.3, 4.2
MyBetterMap, 10.1, 10.4, 11.1
MyFixedHashMap, 11.5
MyHashMap, 11.1, 11.4
MyLinearMap, 9.1
MyLinkedList, 3.5, 3.5, 4.2
MyTreeMap, 12.4, 13.1
map, 8.1, 9
merge sort, 17.2
mergeSort, 17.2
minus, 16.4
mutable, 10.3
Node, 3.5, 6.3, 12.3
Number, 1.2
n log n, 17.3, 17.5
natural order, 16.5
next, 7.2
node, 3.4, 12.2
non-comparison sort, 17.4
null, 3.4
Obama, Barack, 17.4
object diagram, 3.4, 8.3
offer, 17.5
or, 16.4
order of growth, 2.2, 4.2, 5.5, 12.2
ordering, 16.5
out of core algorithm, 17.5
PriorityQueue, 17.5
ProfileListAdd, 4.5
Profiler, 4.3, 5.1
parent node, 6.2
parsing, 6.2
peek, 6.6
performance bug, 3.6, 11.4
persistent, 14.1
poll, 17.5
pop, 6.6
post-order, 6.5
pre-order, 6.5
problem size, 3.3, 5.1
profiling, 2, 4.3, 5.1, 5.1, 5.3, 11.4, 11.5, 13.5
programming to an interface, 1.3
push, 6.6
put, 8.2, 9.2, 9.3, 10.1, 10.4, 11.2, 11.3, 11.5, 12.4, 13.3, 13.5
Queue, 17.5
quadratic time, 2, 2.1, 3.3, 4.1, 4.4, 4.4, 4.5, 5.1, 5.3, 17.1, 17.2, 17.4
query, 16.3
queue, 6.6, 15.4, 16.1
Redis, ??, 14.1, 14.1, 15.1
Redis data type, 14.4
Redis get, 14.4
Redis hash, 14.4
Redis instance, 14.2
Redis list, 14.4
Redis set, 14.4
RedisToGo, 14.2
radix sort, 17.4
raw type, 1.4
recursion, 6.5, 12.4, 13.2, 13.2, 13.4, 17.2
red-black tree, 13.6
regular expression, 8.2
rehash, 11.1
relevance, 16.4, 16.6
remove, 2.3, 3.1, 3.5, 4.1, 9.2, 11.3, 11.5, 13.7
removeAll, 3.3
repository, 0.1
retriever, 1, 6.1, 14
root, 6.2
Schmidt, Eric, 17.4
Set, 8.1
SillyArray, 10.3
SillyString, 10.2
Stack, 6.6
search engine, 1, 6.1, 14
search term, 6.1, 8
select, 6.3
selection sort, 2.1
self-balancing tree, 13.6
server, 14.2, 14.6, 17.7
set, 2.3, 3.1
set intersection, 8.1
set operations, 16.3
setChar, 10.3
singleton, 7.3
size, 3.5, 8.3, 11.5, 11.5, 12.3
slope, 4.4
snippet, 16.6
sort, 16.4
sorting, 2.1, 17
space complexity, 17.7
special case, 3.5
stack, 6.6, 15.4
stop words, 15.3
sub-map, 10.1, 10.2, 11
subclass, 6.3
subtree, 13.3
superclass, 11.1, 11.5, 12.4
TermCounter, 8.2, 14.5, 15.1, 15.3
TextNode, 6.4
TF-IDF, 16.4, 16.6
Timeable, 4.3
Transaction, 14.6, 15.1, 15.2
TreeMap, 12
tag, 6.2
term frequency, 16.4
ternary operator, 1.2
timestamp, 13.5
toString, 10.2
traversal, 15.4
tree, 1
tree traversal, 6.5, 12.4, 13.4
type parameter, 0.1, 2.3, 3.5, 9.1, 17.1
type wildcard, 12.4, 13.1
UML, 11.6
UML diagram, 6.3
Unicode, 10.2
URL, 8.2, 8.3
URLSet, 14.5, 15.1
UUID, 13.5
unbalanced tree, 13.5
union, 16.3
unit of work, 11.2
unit testing, ??, 1.4
value, 8.1
version control, ??, 0.1
volatile, 14.1
WikiCrawler, 15.5, 16.1
WikiFetcher, 7.3, 8.2, 14.3, 14.5
WikiNodeIterable, 6.4, 7.2
WikiNodeIterator, 7.2
WikiPhilosophy, 7.1
Wikipedia, 6.1, 16.1
WikiSearch, 16.4
web search, ??, 1
wrapper method, 8.2
XYSeries, 4.3

Are you using one of our books in a class?

We'd like to know about it. Please consider filling out this short survey.

Think Data Structures