Posted 2022-03-09Updated 2022-03-09LeetCode

LeetCode 1650. Lowest Common Ancestor of a Binary Tree III

Question

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:

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).”

LeetCode 160. Intersection of Two Linked Lists

Question

Given the heads of two singly linked-lists headA and headB, return the node at which the two lists intersect. If the two linked lists have no intersection at all, return null.

The test cases are generated such that there are no cycles anywhere in the entire linked structure.

Note that the linked lists must retain their original structure after the function returns.

LeetCode 1650. Lowest Common Ancestor of a Binary Tree III

Question

LeetCode 160. Intersection of Two Linked Lists

Question

Categories

Tags

Recents

Archives