Distance between two nodes in a Tree In C++. The distance between two nodes can be obtained in terms of the Least Common Ancestor(LCA).

Distance between two nodes in a Tree In C++.

This Algorithm finds the distance between two nodes in a Tree.

It also finds the Least Common Ancestor(LCA) and also the level of the node from the root node.

The Computational time of this Algorithm is of Order of log(n)(O(logn)) and uses constant memory. Therefore this is an optimal Algorithm for finding the distance between two nodes.

The distance between two nodes can be obtained in terms of the Least Common Ancestor(LCA).

Submitted by Chittamuri Hemanth Reddy (hemanth2116)

Download packets of source code on Coders Packet