期刊论文、会议论文

Wang Xingbo

英文

Proceedings of SPIE - The International Society for Optical Engineering

0277-786X

2013

8768

270-272

2011 3rd International Conference on Computer and Automation Engineering(ICCAE 2011)(2011年第三届IEEE计算机与自动化工程国际会议)

2011 3rd International Conference on Computer and Automation Engineering(ICCAE 2011)(2011年第三届IEEE计算机与自动化工程国际会议)论文集

2011-01-21

重庆

[Wang Xingbo] Foshan Univ, Dept Mechtron Engn, Foshan 528000, Peoples R China.^[Zhou Jun] Hunan Agr Univ, Coll Informat Sci&Tech, Changsha 430128, Peoples R China.

电子科技大学<&wdkj&>重庆大学

Zhu, Z

1000 20TH ST, PO BOX 10, BELLINGHAM, WA 98227-0010 USA

SPIE-INT SOC OPTICAL ENGINEERING

978-0-8194-9566-2

10.1117/12.2010765

Foshan Bureau of Science and Technology [2010C012, 2011GY006]

本校为其他机构

Finding the lowest common ancestor (LCA) of two nodes in a binary tree has been focused both in graph theory and computer science. The paper puts forward and proves an analytic criterion for the LCA of two neighboring nodes in a complete binary tree. The criterion mainly concerns addition, subtraction and bitwise operations, needs no searching procedures and thus is easy to implement in software programming as well as hardware programming. An algorithm that has logarithmic time complexity is...