# Tag Archives: LCA

Given a binary tree represented as parent array, find Lowest Common Ancestor between two nodes ‘m’ and ‘n’.  In the above diagram, LCA of 10… Read More
Given a binary tree and 3 nodes a, b and c, the task is to find a node in the tree such that after removing… Read More
Given a binary tree, the task is to find the distance between two keys in a binary tree, no parent pointers are given. Distance between… Read More
Given a binary tree, the task is to find the distance between two keys in a binary tree, no parent pointers are given. The distance… Read More
Given a rooted tree, and two nodes are in the tree, find the Lowest common ancestor of both the nodes. The LCA for two nodes… Read More
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… Read More
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… Read More
Given a binary tree with distinct nodes(no two nodes have the same data values). The problem is to print the path common to the two… Read More
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… Read More
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… Read More
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… Read More
Prerequisites : LCE(Set 1), LCE(Set 2), Suffix Array (n Log Log n), Kasai’s algorithm and Segment Tree The Longest Common Extension (LCE) problem considers a… Read More
The Longest Common Extension (LCE) problem considers a string s and computes, for each pair (L , R), the longest sub string of s that… Read More
Prerequisite : LCA basics, Disjoint Set Union by Rank and Path CompressionWe are given a tree(can be extended to a DAG) and we have many… Read More
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… Read More