# Lowest Common Ancestor (LCA) of binary tree in java

If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions.

In this post, we will see how to find lowest common ancestor(LCA) of two nodes in binary tree. Lets understand with example. As you can see here, LCA is nothing but lowest common parent of two nodes.

### Recursive Algorithm (For nodes A and B):

• If node is null, return it
• If we find A or B, return it.
• Traverse left subtree and right subtree
•  If we get both left and right for any node as not null, it will be lowest common ancestor of two given nodes

#### Complete java program:

When you run above program, you will get below output:

## Java Binary tree tutorial:

Please go through java interview programs for more such programs.

import_contacts

### You may also like: ## Related Posts

• 29 January

### Count subtrees with Sum equal to target in binary tree

Table of ContentsProblemSolution If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. In this post, we will see about how to count subtrees with Sum equal to target in binary tree Problem Given a Binary tree and an integer. You need to find the number of […]

• 17 November

### Lowest Common Ancestor (LCA) for n-ary Tree

Table of ContentsProblemSolution If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see about Lowest Common Ancestor for n-ary Tree. Problem Given a n-ary tree also known as a Generic Tree and also two nodes. You need to find the Lowest common […]

• 16 September

### Check if a binary tree is binary search tree or not in java

Table of ContentsFirst method:Second Method:Complete java program to check if Binary tree is binary search tree or not. If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. In this post, we will see how to check if given binary tree is binary search tree or not. […]

• 16 April

### Delete a node from binary search tree in java

If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. In this post, we will see how to delete a node from binary search tree. There are two parts to it. Search the node After searching that node, delete the node. There are three cases which we […]

• 13 April

### Boundary traversal of binary tree in java

Table of ContentsPrint left edge nodes (Excluding leaf nodes)Print leaf nodes:Print right edge nodes (From bottom to top) :Java Binary tree tutorial: If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. In this post, we will see boundary traversal of binary tree in java. Lets understand […]

• 07 April

### Reverse level order traversal of binary tree in java

If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. This is part of java binary tree tutorial. In this post, we will see about Reverse Level Order binary tree traversal in java. In previous post, we have already seen Level order traversal. In reverse level order […]

## Subscribe to our newletter

Get quality tutorials to your inbox. Subscribe now.