Given a root of the tree you need to perform AVL tree deletion operations on it. You need to complete the method **delelteNode** which takes 2 arguments the first is the root of the tree and the second is the value of the node to be deleted.The function should return the root of the modified tree.

**Note:** Your code will be checked for each insertion and will produce an output 1 if all the nodes for a particular test case were correctly inserted else 0.

**Input:**

The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains 2 lines . The first line of each test case contains an integer N denoting the no of nodes to be inserted in the AVL tree and in the next line are N space separated values denoting the values of the nodes to be inserted to the tree. And last line denotes the element to be deleted.

**Output:**

For each test case output will be 1 if the node was correctly deleted else 0.

**Constraints:**

1<=T<=100

1<=N<=100

**Example(To be used only for expected output):
Input:**

2

2

1 2

1

3

1 2 3

2

1

1

Author: saksham seth

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

KarlBreitkopf | 391 |

vineetjain1 | 278 |

Raunaq Singh 3 | 260 |

vampire123 | 258 |

taruncrrm | 250 |

vampire123 | 796 |

ArushiGarg1 | 784 |

Raunaq Singh 3 | 780 |

nishant.ns19 | 753 |

Liza123 | 725 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4789 |

Quandray | 4457 |

Login to report an issue on this page.