(Solved) : Find Remove Next Smallest Value Binary Search Tree C Use Existing Code Modify Private Bstn Q30671520 . . . .

Find and remove the next smallest value in Binary Search Tree(C#)

Use the existing code, and modify the private BSTNode method toremove the next smallest value, given target number and a node tostart searching at. Note that the two parameters are redundant, inthat the variable smallerThanThis is the value of the BSTNodestartHere. The method should then find (and remove) the BST Nodethat contains the value that is the next smaller value than thistarget value. The return value of the method should be a referenceto the node that you just removed.

private BSTNode FindAndRemoveNextSmallerValue(intsmallerThanThis, BSTNode startHere)
{
BSTNode parent = startHere;
BSTNode child = startHere.Left;
}

// Given