I have built a binary search tree but am really stuck with the delete function.
My code so far is
BSTreeADT removeItem(itemType item, BSTreeADT t)
else if (isEmptyBSTree(rightTree(t)))
/* return new tree constructed with least value in rightTree(t) as root
tree constructed by removing least value from rightTree(t)
please could someone point me in the right direction?