Task
Terminal node
terminalcount
Ternary search
Threaded binary trees
Threads
Time
constant
latency
limits
requirements
seek
Timing
binary search
bubble sort
heap creation
insertion sort
quicksort
reheaping
Top-down design
Top-down programming
Top-down programming
Topological sorting
Topological sorting
analysis
better implementation
better refinement
construction-based algorithm
first refinement
initial implementation
search-based algorithm
topsort
Towers of Hanoi
Towers of Hanoi
Towers of Hanoi
iterative algorithm
recursive algorithm
towers
towers
towers
towers
towers
towers
towers
towers
towers
implementation
Trading storage for time
Transitivity
Translation
of expressions
of infix to postfix
Traversal
2-3 tree
arrays
arrays
arrays
arrays
B-tree
backtracking
backtracking
backtracking
binary trees
branch and bound
breadth-first
depth-first
depth-first
link inversion
list-structure
lists
lists
lists
lists
postorder
postorder
preorder, inorder
preorder, inorder
preorder, inorder
Robson
stackless
threaded
trees
trees
variable-length records
variable-length records
traverse
array of variable length records
array of variable length records
list-structures
list-structures
list-structures
lists
lists
lists
Trees
Trees
Trees
as binary trees
as binary trees
as binary trees
balanced
balanced
binary search
binary
Fibonacci
Fibonacci
general
greedy
leftist
link inverted
name
nearly optimal binary search
optimal binary search
optimal binary
ordered
ordered
ordered
Robson
threaded
traversal
traversal
treesort
Tremblay, J.P.
Tremblay, J.P.
Tridiagonal array
Triple
Triple
local minimal
TRUE
Two-dimensional array
Two-dimensional array
Two-dimensional array
Two-way circular list
Two-way list
Type