1. You are given a partially written BST class. 2. You are required to complete the body of remove function. "remove" function is expected to remove a new node with given data to the tree and return the new root. 3. Input and Output is managed for you. Note -> Please watch the question video to figure out the algorithm required for deletion. It specifies some requirements of the question as well.
Input Format
Input is managed for you
Output Format
Output is managed for you
Constraints
None
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
15 50 25 12 n n 37 n n 75 62 n n 87 n n 62
Output
25 <- 50 -> 75 12 <- 25 -> 37 . <- 12 -> . . <- 37 -> . . <- 75 -> 87 . <- 87 -> .