1650. Lowest Common Ancestor of a Binary Tree III

Given two nodes of a binary tree p and q, return their lowest common ancestor (LCA).

Each node will have a reference to its parent node. The definition for Node is below:

1
2
3
4
5
6
class Node {
    public int val;
    public Node left;
    public Node right;
    public Node parent;
}

According to the definition of LCA on Wikipedia: “The lowest common ancestor of two nodes p and q in a tree T is the lowest node that has both p and q as descendants (where we allow a node to be a descendant of itself).”

1
2
3
4
5
Example 1:

Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 1
Output: 3
Explanation: The LCA of nodes 5 and 1 is 3.

ex1

1
2
3
4
5
Example 2:

Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 4
Output: 5
Explanation: The LCA of nodes 5 and 4 is 5 since a node can be a descendant of itself according to the LCA definition.

ex1

1
2
3
4
Example 3:

Input: root = [1,2], p = 1, q = 2
Output: 1

Constraints:

The number of nodes in the tree is in the range [2, 105].
-10^9 <= Node.val <= 10^9
All Node.val are unique.
p != q
p and q exist in the tree.

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
/*
// Definition for a Node.
class Node {
    public int val;
    public Node left;
    public Node right;
    public Node parent;
};
*/

class Solution {
    public Node lowestCommonAncestor(Node p, Node q) {
        
        Node runner1 = p;
        Node runner2 = q;
        
        
        while (runner1 != runner2) {
            runner1 = (runner1 == null) ? q: runner1.parent;
            runner2 = (runner2 == null) ? p: runner2.parent;
        }
        return runner1;
    }
    
    /** DIFF HEIGTH APROACH **/
    public Node lowestCommonAncestor2(Node p, Node q) {
        int depth1 = depth(p);
        int depth2 = depth(q);
        
        if (depth1 < depth2) {
            return lowestCommonAncestor(q, p);
        }
        int diff = depth1 - depth2;
        while (diff > 0) {
            p = p.parent;
            diff--;
        }
        while (p != q) {
            q = q.parent;
            p = p.parent;
        }
        
        return p;
    }    
    
    int depth(Node node) {
        Node parent = node.parent;
        int count = 0;
        while (parent != null) {
            parent = parent.parent;
            count++;
        }
        return count;
    } 
    
    
    
    /** HASH SET APPROACH */
    public Node lowestCommonAncestor1(Node p, Node q) {
        Set<Node> seen = new HashSet<Node>();
        
        while (p != null) {
            seen.add(p);
            p = p.parent;
        }
        
        while (q != null) {
            if (seen.contains(q)) {
                return q;
            }
            q = q.parent;
        }
        
        return null;
    }
}

Solution 2022-01-30

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
/*
// Definition for a Node.
class Node {
    public int val;
    public Node left;
    public Node right;
    public Node parent;
};
*/

class Solution {
    public Node lowestCommonAncestor(Node p, Node q) {
        Node s = p;
        Node f = q;
        while (s != f) {
            s = s.parent;
            f = f.parent;
            
            if (s == null) {
                s = p;
            }
            if (f == null) {
                f = q;
            }
        }
        return s;
    }
}

Solution 2022-01-30#

Solution 2022-01-30