March 2011
Intermediate
976 pages
28h 1m
English
2-3 search tree 424–431
2-nodes and 3-nodes 424
analysis of 429
defined 424
height 429
insertion 425–427
order 424
perfect balance 424
and red-black BST 432
search 425
2-3 tree. See 2-3 search tree
2-colorability problem 546
2-dimensional array 19
2-satisfiability problem 599
2-sum problem 189
3-collinear problem 211
3-way partitioning 298
3-way quicksort 298–301
3-way string quicksort 719–723
8-puzzle problem 358
32-bit architecture 13, 201, 212
A* algorithm 350
Abstract data type 64
API 65
client 88–89
design 96–97
implementing an 84–87
multiple implementations 90
Abstract in-place merge 270
Accumulator data type 92–93
Acyclic ...
Read now
Unlock full access