Data Structures and the Java Collections Framework, Third Edition

INDEX

A

Abstract class, 137–139

versus fully defined class and interface, 139–140

Abstract data type, 31

Abstract method, 29

abstract modifier, 138

Abstraction,

data, 27–28

Accessor method, 57

Activation record, 209, 334

Active method, 208

Acyclic graph, 646, 648, 667, 669, 693–694

Adjacent vertices, 644

Aggregation, 51

Algorithm, 105

connectedness, 658–659

divide-and-conquer, 476–477

longest path, 667–669

minimum spanning tree, 659–663

shortest path, 663–667

Algorithm analysis, 105–121

Alternate implementation(s)

of the BinarySearchTree class, 449–451

of the HashMap class, 626–635, 640

of the LinkedList class, 294–295, 323

A-maze-ing application, 195–208

Ancestor, 379, 439

Application Programming Interface (API), 6

Applications

backtracking through a maze, 195–208

backtracking through a network, 686–689, 695–697

converting from infix to postfix, 338–343

creating a symbol table, 617–625

high-precision arithmetic, 251–257

how compilers implement recursion, 334–337

Huffman encoding, 573–590

line editor, 300–315

simulated car wash, 351–365

spell checker, 530–536

thesaurus, 517–525

Approval voting (project), 545–547

Argument, 19

ArrayList class, 234–251

fields in, 248

heading of, 246–247

versus LinkedList class, 150, 282–285

ArrayList objects,

serializing, 247, 701–702

simple program using, 244–246

Arrays class

binarySearch, 112–113, 180

sort (Merge Sort), 470–476

(Quick Sort), 477–489

assertArrayEquals, 62, 458

assertEquals, 62

Association, 51

Attribute in Unified Modeling Language, ...