The Art of Computer Programming, Volume 1

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