O(1) Reversible Tree Navigation Without Cycles

Richard A. O'Keefe

Imperative programmers often use cyclically linked trees in order to achieve O(1) navigation time to neighbours. Some logic programmers believe that cyclic terms are necessary to a…