Given a Binary Search Tree (BST) and a node value. Delete the node with the given value from the BST. If no node with value x exists, then do not make any change.
Input: 2 / \ 1 3 X = 12 Output: 1 2 3 Explanation: In the given input there is no node with value 12 , so the tree will remain same.
Input: 1 \ 2 \ 8 / \ 5 11 / \ / \ 4 7 9 12 X = 9 Output: 1 2 4 5 7 8 11 12 Explanation: In the given input tree after deleting 9 will be 1 \ 2 \ 8 / \ 5 11 / \ \ 4 7 12
You don't need to read input or print anything. Your task is to complete the function deleteNode() which takes two arguments. The first being the root of the tree, and an integer 'X' denoting the node value to be deleted from the BST. Return the root of the BST after deleting the node with value X. Do not make any update if there's no node with value X present in the BST. The inorder traversal of the tree is printed by the driver's code.
Expected Time Complexity: O(Height of the BST).
Expected Auxiliary Space: O(Height of the BST).
1 <= N <= 100000
Note: The Input/Output format and Example are given are used for the system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from the stdin/console. The task is to complete the function specified, and not to write the full code.
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.