**Compilation/Execution Result:**

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.

Example:

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.

**Input:**

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.

**Output:**

For each test the function should return the Kth ancestor of the given Node form the binary tree.

**Constraints:**

1<=T<=500

1<=N<=10^{3}

**Example:
Input:**

2

2

1 2 L 1 3 R

1 3

4

1 2 L 1 3 R 2 4 L 2 5 R

2 4

1

1

Pulkit Gupta 2 | 130 |

Relentless | 124 |

Ibrahim Nash | 94 |

nancygarg258_pec | 90 |

darkswordsman | 90 |

Ibrahim Nash | 602 |

KartikAgarwal | 541 |

rs119574 | 371 |

surbhi_7 | 356 |

Little Noah | 335 |

akhayrutdinov | 4261 |

sanjay05 | 3633 |

Ibrahim Nash | 3162 |

Quandray | 3028 |

Michael Riegger | 2359 |