Lowest Common Ancestor - Amazon Top Interview Questions


Problem Statement :


Given a binary tree root, and integers a and b, find the value of the lowest node that has a and b as descendants. A node can be a descendant of itself.

All nodes in the tree are guaranteed to be unique.

Constraints

n ≤ 100,000 where n is the number of nodes in root

Example 1

Input

root = [0, [1, null, null], [2, [6, [3, null, null], [4, null, null]], [5, null, null]]]

a = 3

b = 5

Output

2

Example 2

Input

root = [0, [1, null, null], [2, [6, [3, null, null], [4, null, null]], [5, null, null]]]

a = 6

b = 4

Output

6


Solution :



title-img 




                        Solution in C++ :

int solve(Tree* root, int a, int b) {
    if (root == NULL) return INT_MIN;
    if (root->val == a or root->val == b) return root->val;

    int left = solve(root->left, a, b);
    int right = solve(root->right, a, b);

    if (left != INT_MIN and right != INT_MIN) {
        return root->val;
    }

    return left != INT_MIN ? left : right;
}
                    


                        Solution in Java :

import java.util.*;

/**
 * public class Tree {
 *   int val;
 *   Tree left;
 *   Tree right;
 * }
 */
class Solution {
    public Tree lca(Tree root, int a, int b) {
        if (root == null) {
            return null;
        }

        if (root.val == a || root.val == b) {
            return root;
        }

        Tree left = lca(root.left, a, b);
        Tree right = lca(root.right, a, b);

        if (left != null && right != null) {
            return root;
        }

        if (left != null) {
            return left;
        }

        if (right != null) {
            return right;
        }

        return null;
    }

    public int solve(Tree root, int a, int b) {
        return lca(root, a, b).val;
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def solve(self, root, a, b):
        nodes = {}
        count = 0

        def dfs(root, st):
            nonlocal nodes, count
            if count < 2:
                if not root:
                    return
                if root.left:
                    dfs(root.left, st + [root.left.val])
                if root.val in [a, b]:
                    count += 1
                nodes[root.val] = st
                if root.right:
                    dfs(root.right, st + [root.right.val])
            else:
                return

        dfs(root, [root.val])
        st1, st2 = nodes[a], nodes[b]
        for i in range(min(len(st1), len(st2))):
            if st1[i] == st2[i]:
                ans = st1[i]
        return ans


View More Similar Problems

Palindromic Subsets

Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t

View Solution →

Counting On a Tree

Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n

View Solution →

Polynomial Division

Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie

View Solution →

Costly Intervals

Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the

View Solution →

The Strange Function

One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting

View Solution →

Self-Driving Bus

Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever

View Solution →