LCA

30+ posts

Similar Topics

DSA

20.6k+ articles

Competitive Programming

1.4k+ articles

1.4k+ articles

1.3k+ articles

970+ articles

810+ articles

Advanced Data Structure

460+ articles

array-range-queries

370+ articles

DFS

340+ articles

Binary Tree

320+ articles

Shortest distance between two nodes in BST

Last updated: 02 January 2023

Given a Binary Search Tree and two keys in it. Find the distance between two nodes with given two keys. It may be assumed that both keys exist in BST.Examples:Input: Root...read more

Print common nodes on path from root (or common ancestors)

Last updated: 15 September 2023

Given a binary tree and two nodes, the task is to Print all the nodes that are common for 2 given nodes in a binary tree.Examples:Given binary tree is : ...read more

Tree

LCA

DSA

Sqrt (or Square Root) Decomposition | Set 2 (LCA of Tree in O(sqrt(height)) time)

Last updated: 06 April 2023

Prerequisite: Introduction and DFSThe task is to find LCA of two given nodes in a tree (not necessarily a Binary Tree). In previous posts, we have seen how to calculate LC...read more

Tree

Advanced Data Structure

Competitive Programming

LCA

array-range-queries

DSA

Maximum element between two nodes of BST

Last updated: 13 September 2023

Given an array of N elements and two integers A, B which belong to the given array. Create a Binary Search Tree by inserting elements from arr[0] to arr[n-1]. The task is ...read more

Binary Search Tree

LCA

DSA

LCA for general or n-ary trees (Sparse Matrix DP approach )

Last updated: 20 January 2023

In previous posts, we have discussed how to calculate the Lowest Common Ancestor (LCA) for a binary tree and a binary search tree (this, this and this). Now let’s look at ...read more

Tree

Advanced Data Structure

Competitive Programming

Lowest Common Ancestor in a Binary Tree using Parent Pointer

Last updated: 14 February 2023

Given values of two nodes in a Binary Tree, find the Lowest Common Ancestor (LCA). It may be assumed that both nodes exist in the tree.For example, consider the Binary Tre...read more

Tree

LCA

DSA

Implementation of Heavy Light Decomposition

Last updated: 14 March 2023

We strongly recommend to refer below post as a prerequisite of this.Heavy Light Decomposition | Set 1 (Introduction)In the above post, we discussed the Heavy-light decompo...read more

Advanced Data Structure

Introduction to Heavy Light Decomposition

Last updated: 23 December 2022

Heavy Light decomposition (HLD) is one of the most used techniques in competitive programming.Example Problem: Let us understand Heavy-light decomposition (HLD) with the h...read more

Advanced Data Structure

Find LCA in Binary Tree using RMQ

Last updated: 31 July 2022

The article describes an approach to solving the problem of finding the LCA of two nodes in a tree by reducing it to an RMQ problem.The Lowest Common Ancestor (LCA) of two...read more

Tree

Advanced Data Structure

Segment-Tree

LCA

DSA

Find distance between two nodes of a Binary Tree

Last updated: 30 January 2023

AucFind the distance between two keys in a binary tree, no parent pointers are given. The distance between two nodes is the minimum number of edges to be traversed to reac...read more

Lowest Common Ancestor in a Binary Tree

Last updated: 17 April 2023

What is Lowest Common Ancestor in Binary Tree?The lowest common ancestor is the lowest node in the tree that has both n1 and n2 as descendants, where n1 and n2 are the nod...read more

Lowest Common Ancestor in a Binary Search Tree.

Last updated: 13 September 2023

Given two values n1 and n2 in a Binary Search Tree, find the Lowest Common Ancestor (LCA). You may assume that both values exist in the tree.Let T be a rooted tree. The lo...read more

1 2 3 >>

1 2 3 >>

1 2 3 >>