To delete a node that have 2 children in a binary search tree, will it differ if I replace that node with the highest (rightmost) element in the left subtree of that node or with the lowest (leftmost) element in the right subtree of that node?
valid question