Lowest common ancestor in a binary Tree

Approach

  1. Define a recursive function rec that takes three parameters: root (the current node), p (first node to find the lowest common ancestor for), and q (second node to find the lowest common ancestor for).

  2. Check if the current node root is null or if it is either p or q. If any of these conditions is true, return the current node root as the lowest common ancestor.

  3. Recursively call the rec function for the left subtree of the current node and assign the result to a variable l.

  4. Recursively call the rec function for the right subtree of the current node and assign the result to a variable r.

  5. Check if both l and r are not null. If so, it means that p and q are found on different subtrees of the current node, and the current node root is their lowest common ancestor. Return the current node root.

  6. If l is null, it means that both p and q are on the right subtree (or not present in the tree). Return r.

  7. If none of the above conditions are met, it means that both p and q are on the left subtree (or not present in the tree). Return l.

  8. Define a function lowestCommonAncestor that takes three parameters: root (the root node of the tree), p (first node to find the lowest common ancestor for), and q (second node to find the lowest common ancestor for).

  9. Return the result of calling the rec function with the parameters root, p, and q. This will find and return the lowest common ancestor of nodes p and q in the given binary tree.

Comments

Post a Comment

Popular posts from this blog

LeetCode 3Sum

Question Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets. Brute force We can run 3 loops to check each possible triplets, we also need to eliminate the duplicates from both sides. this method will work but will work but will give time limit exceed after time constraints. To do this in given time limit we need to sort the array first and Create a loop that fixes the left most integer. This reduces the problem to 2sum for remaining array. For each loop iteration where duplicates are skipped, we need to do a left/right iteration using while loop. my code:
Read more

30. Substring with Concatenation of All Words

Problem Statement You are given a string s and an array of strings words. All the strings of words are of the same length. A concatenated substring in s is a substring that contains all the strings of any permutation of words concatenated. For example, if words = ["ab","cd","ef"], then "abcdef", "abefcd", "cdabef", "cdefab", "efabcd", and "efcdab" are all concatenated strings. "acdbef" is not a concatenated substring because it is not the concatenation of any permutation of words. Return the starting indices of all the concatenated substrings in s. You can return the answer in any order. Example 1: Input: s = "barfoothefoobarman", words = ["foo","bar"] Output: [0,9] Explanation: Since words.length == 2 and words[i].length == 3, the concatenated substring has to be of length 6. The substring starting at 0 is "barfoo". It is the concaten...
Read more