Skip to content

Create 236-Lowest-Common-Ancestor-of-a-Binary-Tree.java #112

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jun 8, 2022
Merged

Create 236-Lowest-Common-Ancestor-of-a-Binary-Tree.java #112

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Create 236-Lowest-Common-Ancestor-of-a-Binary-Tree.java 
Java language
  • Loading branch information
@ArwaNayef
ArwaNayef authored Apr 8, 2022
commit 5f15b267d7e6ef6cda37ce3238edfa8dd582475c
14 changes: 14 additions & 0 deletions java/236-Lowest-Common-Ancestor-of-a-Binary-Tree.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if(root==null) return null;
if((root.val==p.val || root.val==q.val))return root;
TreeNode left=lowestCommonAncestor(root.left,p,q);
TreeNode right=lowestCommonAncestor(root.right,p,q);

if(left!=null&&right!=null){return root;}
else if(left!=null)return left;
else return right;

}

}