Beyond the book
Several structures and algorithms that the book does not describe, but
that a course on the subject usually covers (e.g., the realizations with
cursors, the parenthesized lists of trees, the general schemes of the
techniques), are written on the same classes and tested in
test/beyond.cpp.
What |
Header |
Test |
|---|---|---|
binary tree in a positional vector |
|
|
binary and ordered trees with cursors |
|
|
ordered tree in a vector in preorder |
|
|
heap on a binary tree with pointers |
|
|
graph of node objects with pointers |
|
|
k stacks in one vector |
|
|
search, order, bubble and natural merge sort on sequences |
|
|
palindromes and sorting with a stack |
|
|
naive and Knuth-Morris-Pratt string matching |
|
|
exercises on lists, strings, trees and arrays |
|
|
list with cursors in a shared space with a free list |
|
|
range of C++ over any sequence |
|
|
search with the place of insertion and sublists of a sorted sequence |
|
|
postfix expressions, infix to postfix (shunting-yard) |
|
|
queue with no duplicates, positive items of a queue |
|
|
dictionary on a sorted vector, pseudo-random inspection |
|
|
decision tree of the binary search |
|
|
trees as parenthesized lists, tree of an expression, tree with lists of children |
|
|
union by size in the MFSET |
|
|
general visit of a graph, unilateral connection |
|
|
general schemes of the techniques (enumeration, backtracking, greedy, divide et impera) |
|
|
Knuth’s strong failure function, Hibbard’s gaps, sentinels, minimum and maximum together |
|
|
greedy and backtracking knapsack, eight puzzle by breadth and depth |
|