Code-Crossroad
Code-Crossroad copied to clipboard
Lowest Common Ancestor of a Binary Tree
Aim Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
Details “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”
I would like to work on this in C++. Will you please assign it to me?
@lucy2512 you can work on this issue. All the best!
I would like to work on this issue in Java. Please assign this to me @Ananyaas @Vanshikagarg17.