Code-Crossroad icon indicating copy to clipboard operation
Code-Crossroad copied to clipboard

Lowest Common Ancestor of a Binary Tree

Open Vanshikagarg17 opened this issue 3 years ago • 3 comments

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).”

Vanshikagarg17 avatar Oct 04 '21 18:10 Vanshikagarg17

I would like to work on this in C++. Will you please assign it to me?

lucy2512 avatar Oct 05 '21 14:10 lucy2512

@lucy2512 you can work on this issue. All the best!

Ananyaas avatar Oct 06 '21 18:10 Ananyaas

I would like to work on this issue in Java. Please assign this to me @Ananyaas @Vanshikagarg17.

SmritiOjha23 avatar Oct 24 '21 05:10 SmritiOjha23