On computing distances between leaves in a complete tree

References

• Aho , A.V. , Hopcroft , J.E. and Ullman , J.D. 1974 . The Design and Analysis of Computer Algorithms , Reading, MA : Addison-Wesley .
   Google Scholar
• Aho , A.V. , Hopcroft , E. and Ullman , J.D. 1976 . On finding lowest common ancestors in Trees . SIAM. J. Comput , 5 : 115 – 132 .
   Google Scholar
• Bentley , J.L. and Yao , A.C.C. 1976 . An almost optimal algorithm for unbounded searching . Inf. Proc. Let , 5 : 82 – 87 .
   Google Scholar
• Demillo , R.A. , Eisenstat , S.C. and Lipton , R.J. 1978 . Preserving average proximity in arrays . C.ACM , 21 : 228 – 231 .
   Google Scholar
• Rosenberg , A.L. 1978 . Data encodings and their costs . Acta Inform , 9 : 273 – 292 .
   Google Scholar
• Rosenberg , A.L. 1979 . Encoding data structures in trees . J. ACM , 26 : 668 – 689 .
   Google Scholar
• Solntseff , N. and Wood , D. 1977 . Pyramids: a data type for matrix representation in Pascal . BIT , 17 : 344 – 350 .
   Google Scholar