Data Structures and Algorithms in Java, 6th Edition

Index

% operator, 24, 242

== operator, 25, 138

^ operator, 412

Abelson, Hal, 223

abstract class, 80–81, 313–314, 323

abstract data type, 62

deque, 248–249

graph, 612–618

map, 402–404

partition, 672–675

positional list, 272–275

priority queue, 361

queue, 239–240

sorted map, 428

stack, 227–228

string, 17–18

tree, 312–314

abstract methods, 80

abstract modifier, 11, 81

AbstractBinaryTree class, 319–320, 323, 325, 330, 339, 341, 342

AbstractHashMap class, 406, 422–424

abstraction, 62

AbstractMap class, 384, 406–407, 408, 422

AbstractPriorityQueue class, 364–365, 366

AbstractSortedMap class, 406, 430, 466

AbstractTree class, 313–316, 323, 330, 339–342

(a, b) tree, 702–704

access frequency, 294

accessor method, 5

activation record, see frame

acyclic graph, 615

adaptability, 60, 61

adaptable priority queue, 390–392, 658, 659

adapter design pattern, 233, 245

Adel'son-Vel'skii, Georgii, 479, 530

adjacency list, 619, 622–623

adjacency map, 619, 624, 626

adjacency matrix, 619, 625

Aggarwal, Alok, 709

Aho, Alfred, 256, 305, 530, 610

Ahuja, Ravindra, 686

algorithm analysis, 164–181

alphabet, 17, 575

amortization, 205, 266–269, 376, 672–675

ancestor, 310

antisymmetric property, 363

Apache Commons, 448

API, 76, 228

arithmetic operators, 24

arithmetic progression, 71, 268

Arnold, Ken, 57

array, 20–21, 104–119

dynamic, 263–269

array list, 260–265

ArrayDeque class, 251

ArrayIndexOutOfBounds exception, 20, 33, 84, 87

ArrayList class, 260–261, 263–265, 283–285, 290

ArrayQueue class, 242–244, 302