The Art of Computer Programming: Fundamental algorithms

algorithm terminates ALINK allocation assume ATOM AVAIL list available blocks binary tree binomial coefficients buffer bytes COBOL coefficients coroutine corresponding cycle Data Table defined delete denote directed graph doubly linked list elements elevator ENT1 ENTA equivalent Eulerian circuit example exercise formula free tree function garbage collection given index register induction INFO input insert instruction integer jump link fields list head LLINK mathematical matrix memory locations method MIXAL node notation operation oriented tree otherwise set output OVERFLOW permutation pointer polynomial positive integers postorder preorder problem prove queue real numbers representation RLINK root routine Section sequence set Q Show simulation stack step storage subroutine subtree tape techniques theorem threaded tree topological sorting traversal tree structure variable vertex vertices word zero