A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Paper
On Computing Distances Between Leaves in a Complete Tree
Abstract
Two algorithms are presented and analyzed, which compute the distance between any pair of leaves of a complete tree. The first algorithm is quite efficient, running in time 0(log2 distance) on a uniform-cost RAM. The second algorithm is somewhat less efficient, though it too runs on a uniform-cost RAM in time O(log2 distance); it is presented mainly because its validity depends on an interesting numerological descriptor of complete trees. © 1980, Taylor & Francis Group, LLC
Related
Chai Wah Wu
Linear Algebra and Its Applications
W.C. Tang, H. Rosen, et al.
SPIE Optics, Electro-Optics, and Laser Applications in Science and Engineering 1991
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990