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.