Skip to content

Instantly share code, notes, and snippets.

@Raghav2211

Raghav2211/lowest_Common_Ancestor_of_a_Binary_Search_Tree.java

Created March 30, 2022 12:03
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save Raghav2211/fe2639569c7b4817a47380b01f7a47fd to your computer and use it in GitHub Desktop.
Save Raghav2211/fe2639569c7b4817a47380b01f7a47fd to your computer and use it in GitHub Desktop.
Download ZIP
Raw
lowest_Common_Ancestor_of_a_Binary_Search_Tree.java
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if( (p.val == root.val || q.val == root.val) || ( p.val < root.val && q.val > root.val)){
return root;
}
TreeNode ans = root;
if(p.val< root.val && q.val < root.val ){ //left
ans = lowestCommonAncestor(root.left,p,q);
}
else if(p.val > root.val && q.val > root.val) { // right
ans = lowestCommonAncestor(root.right,p,q);
}
return ans;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment