The CS Detective

Index

A

algorithms, 7

adapting, 55

parallel, 110–112, 115–116

recursive, 155

search. See search algorithms

amortized cost, 172

ArrayCart, 21

arrays, 15, 19–24

and binary search, 36–38

for heaps, 219–222

index of, 19, 24, 28

for queues, 100–101

sorted, 36

and binary search tree construction, 147–150

for stacks, 99–100

for strings, 25–28

B

back pointers, 80

backtracking, 67–70, 84–88, 106

best-first search, 189–192

for investigations, 189

for locks, 203–205

priority queues, 196, 203–205

binary search, 33–38, 41–43, 49–52

binary search ladders, 138–142, 145–149

for artwork, 138, 147–149

snake rungs, 147, 149

as traps, 139–140

binary search trees, 138–144

balanced, 144, 168

child node, 138, 143

construction, 147–150

inserting nodes, 167–169

property, ...