The idea of the recurred entry method is to write out all of the work done by the recursive [inaudible] algorithm in a tree structure, with the children of a given [inaudible] corresponding to the recursive calls made by that [inaudible]. 