|All-time Popular Problems|
|Check if subtree|
|Delete Middle of Linked List|
|Given a linked list of 0s, 1s and 2s, sort it.|
|Count nodes of linked list|
|Delete N nodes after M nodes of a linked list|
|Check for Balanced Tree|
|Remove every k'th node|
|k largest elements|
|0 - 1 Knapsack Problem|
|Subarray with given sum|
Given a binary tree of size N, a node and a positive integer K., your task is to complete the function kthAncestor(), the function should return the Kth ancestor of the given node in the binary tree. If there does not exist any such ancestor then return -1.
Input: K = 2 Node = 4 Output: 1 Since, K is 2 and node is 4, so we first need to locate the node and look k times its ancestors. Here in this Case node 4 has 1 as his 2nd Ancestor aka the Root of the tree.
The function takes three arguments as input, first the reference pointer to the root of the binary tree, second an integer variable K denoting the kth ancestor and last the integer variable Node, denoting the node whose ancestor is to be located.
There will be T, test cases and for each test case the function will be called separately.
For each test the function should return the Kth ancestor of the given Node form the binary tree.
1 2 L 1 3 R
1 2 L 1 3 R 2 4 L 2 5 R