Algorithms for Computing LCA in Complete Binary Trees

WANG Jue; LUO Qirong

Information

Journal Policies

Useful Links

International Journal of Research Studies in Computer Science and Engineering

Volume 2, Issue 4, 2015, Page No: 1-6

Algorithms for Computing LCA in Complete Binary Trees

WANG Jue¹, LUO Qirong²

1.Guangdong Neptune High-tech Co. Lt., Foshan City, Guangdong Province, PRC.
2.Department of Mechatronics, Foshan University, Foshan City, Guangdong Province, PRC.

Citation : WANG Jue, LUO Qirong, Algorithms for Computing LCA in Complete Binary Trees International Journal of Research Studies in Computer Science and Engineering 2015, 2(4) : 1-6

Abstract

Based on properties of the lowest common ancestor (LCA) of two nodes in a complete binary tree, the paper designs three algorithms as well as their C-language codes to compute the LCAs. The designed algorithms contain both an elementary version that is simple, easily-understood and easilyrealized and a high-efficient version that can be applied for developments of embedded systems and SoC. The paper is of a reference to development of embedded systems and related area.

Download Full paper: Click Here