Closed SonaVarshney closed 7 months ago
@karishma-2020 @kratika-Jangid @bh-g pls merge the day-15: q1 to the repo. Thanks :) #363
please assign this question to me :) @bh-g @karishma-2020
Please assign this issue to me .
Please assign this issue to me
please assign this question to me @bh-g @karishma-2020
@bh-g Please assign it to me
Pls assign this issue @bh-g
@kratika-Jangid @karishma-2020 @bh-g please merge the solution ,thanks :) #380
Lowest Common Ancestor of a Binary Tree
Problem Description
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
According to the definition of LCA on Wikipedia: “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).”
Example 1:
Input
: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 1Output
: 3Explanation
: The LCA of nodes 5 and 1 is 3.Example 2:
Input
: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 4Output
: 5Explanation
: The LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.Example 3:
Input
: root = [1,2], p = 1, q = 2Output
: 1Constraints: