65. Binary Lifting

Hard

Topics

Input: graph = [[1, 2], [0], [0]], node = 1, k = 1

Output: 0

Explanation: The 1st ancestor of node 1 is node 0.

Input: graph = [[1, 2], [0, 3], [0], [1]], node1 = 3, node2 = 2

Output: 0

Explanation: The Lowest Common Ancestor of node 3 and node 2 is node 0.

Input: graph = [[],[0],[0],[1,6,7],[5],[4,10],[3,8,9],[3],[6],[6],[5,11],[10],[13],[12],[15],[14],[]], node = 11, k = 4

Output: 0

Explanation: The 4th ancestor of node 11 is node 0.

Time Complexity

O(log n)

Space Complexity

O(n log n)

Code Runner is not available for this problem.

Fetching algorithms...