Getting started with algorithm Sorting Bubble Sort Algorithm Complexity Graph Dynamic Programming Kruskal's Algorithm Greedy Algorithms Searching Big-O Notation Bellman–Ford Algorithm Merge Sort Binary Search Trees Trees Insertion Sort Hash Functions Travelling Salesman Substring Search Dijkstra’s Algorithm Floyd-Warshall Algorithm Breadth-First Search Bucket Sort Quicksort Depth First Search Knapsack Problem Counting Sort Cycle Sort Heap Sort Prim's Algorithm Matrix Exponentiation Pigeonhole Sort Radix Sort Equation Solving Odd-Even Sort Pseudocode Catalan Number Algorithm Integer Partition Algorithm A* Pathfinding Shell Sort Selection Sort Pancake Sort Longest Common Subsequence Longest Increasing Subsequence Maximum Path Sum Algorithm Maximum Subarray Algorithm Dynamic Time Warping Pascal's Triangle Line Algorithm Shortest Common Supersequence Problem Sliding Window Algorithm Applications of Greedy technique Online algorithms Fast Fourier Transform A* Pathfinding Algorithm Check if a tree is BST or not Binary Tree traversals Lowest common ancestor of a Binary Tree Graph Traversals polynomial-time bounded algorithm for Minimum Vertex Cover Multithreaded Algorithms Algo:- Print a m*n matrix in square wise Check two strings are anagrams Edit Distance Dynamic Algorithm Applications of Dynamic Programming Knuth Morris Pratt (KMP) Algorithm

Lowest common ancestor of a Binary Tree

Finding lowest common ancestor

Consider the tree:

Lowest common ancestor of nodes with value 1 and 4 is 2

Lowest common ancestor of nodes with value 1 and 5 is 3

Lowest common ancestor of nodes with value 2 and 4 is 4

Lowest common ancestor of nodes with value 1 and 2 is 2

Contributors

Topic Id: 8848

Example Ids: 27564

This site is not affiliated with any of the contributors.