Lowest common ancestor in a binary tree

In a binary tree, the lowest common ancestor (LCA) of two nodes is the lowest (i.e., deepest) node that has both of the given nodes as descendants. In other words, it is the node that is furthest from the root node of the tree, and is a parent of both of the given nodes.

Given a binary tree and find out the lowest common ancestor node using of two exist binary tree node. That is very interesting problem because trace Lowest common ancestor you need to write good logic. First let's see few test cases to find lowest ancestor in BT.

There are other case also possible when both node are not exist in binary tree or given both nodes are same.

Here given code implementation process.

1) Lowest common ancestor of a binary tree in java 2) Lowest common ancestor of a binary tree in c++ 3) Lowest common ancestor of a binary tree in c 4) Lowest common ancestor of a binary tree in c# 5) Lowest common ancestor of a binary tree in vb.net 6) Lowest common ancestor of a binary tree in php 7) Lowest common ancestor of a binary tree in node js 8) Lowest common ancestor of a binary tree in python 9) Lowest common ancestor of a binary tree in ruby 10) Lowest common ancestor of a binary tree in scala 11) Lowest common ancestor of a binary tree in swift 12) Lowest common ancestor of a binary tree in kotlin 13) Lowest common ancestor of a binary tree in typescript 14) Lowest common ancestor of a binary tree in golang