Associated Course(s):
Interview Preparation
Sudo Placement [IITs]

Given a Binary Search Tree (BST) and a node no** 'x' **, your task is to delete the node **'x'** from the BST . You are required to complete the function **deleteNode. **You should not read any input from stdin/console. There are multiple test cases. For each test case, this method will be called individually.

**Input (only to be used for Expected Output):**

The first line of the input contains an integer **'T'** denoting the number of test cases. Then **'T'** test cases follow. Each test case consists of three lines. Description of test cases is as follows:

The First line of each test case contains an integer **'N'** which denotes the no of nodes in the BST. .

The Second line of each test case contains **'N'** space separated values of the nodes in the BST.

The Third line of each test case contains an integer **'x'** the value of the node to be deleted from the BST.

**Output:**

You are required to complete the function **deleteNode** which takes two arguments. The first being the root of the tree, and an integer **'x'** denoting the node to be deleted from the BST . The function returns a pointer to the root of the modified BST .

**Constraints:**

1 <= T <= 50

1 <= N <= 50

**Example:
Input**

1

7

2 81 87 42 66 90 45

81

2 42 45 66 87 90

Author: Shubham Joshi 1

11620078 | 164 |

RohitBattu | 127 |

Maninder07 | 126 |

blackshadows | 120 |

Rags Bhasin | 110 |

blackshadows | 880 |

xmyqsh | 565 |

mb1973 | 439 |

aman19 | 402 |

shubhamjain237 | 376 |

akhayrutdinov | 5014 |

Ibrahim Nash | 4899 |

Quandray | 4338 |

sanjay05 | 3668 |

blackshadows | 3384 |

Login to report an issue on this page.