/* Write a function that removes a node from a binary search tree. Your function should * keep the tree ordered and should run in time O(h), where h is the height of the tree. */