Skip to content

Tag Archives: LCA

Prerequisites – Graph, Spanning tree, Disjoint Set (Union – Find). A minimum spanning tree (MST) T, for a given graph G, spans over all vertices… Read More
Given a Binary Tree consisting of N nodes having distinct values from the range [1, N], the task is to find the lowest common ancestor… Read More
Given two nodes of a binary tree v1 and v2, the task is to check if two nodes are on the same path in a… Read More
Given a binary tree having N nodes and weight of N-1 edges. The distance between two nodes is the sum of the weight of edges… Read More
Given a weighted tree containing N nodes, and two nodes u and v, the task is to find the count of nodes having prime weight… Read More
Given a rooted tree with N nodes, the task is to find the Lowest Common Ancestor for a given set of nodes V of that… Read More
Given a binary tree (not a binary search tree) and any number of Key Nodes, the task is to find the least common ancestor of… Read More
Given a tree with N nodes and N – 1 edges. Each edge of the tree is labeled by a string of lowercase english alphabets.… Read More
Given three vertices U, V and R of a binary tree, the task is to check whether R lies in the path between U and… Read More
Given a binary tree, the task is to find the Lowest Common Ancestor of the given two nodes in the tree. Let G be a tree… Read More
Given a binary tree and two nodes a and b, the task is to print the minimum and the maximum node value that lies in… Read More
Given a binary tree and two nodes of that binary tree. Find the sum of all nodes with odd values in the path connecting the… Read More
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