Implement a decrease-and-conquer variable-size-decrease algorithm for finding the largest key in a binary search tree. Test with a binary search tree of 100 nodes made of random key

Using a self-balancing binary search tree, binary tree sort is nevertheless slower than merge sort, taking O(n log n) time in the worst case.

put words into a binary search tree.  the options are in red words.

In a binary search tree, to remove a node N that has parent P and one child C, we do the following:   Group of answer choices If C is the right child of N, we make C the right child of P, and if C is the left child of N, we make C the left child of P   If C is the right child of N, we make C the left child of P, and if C is the left child of N, we make C the right child of P   If N is the left child of P, we make C the left child of P and if N is the right child of P, we make C the right child of P   If N is the left child of P, we make C the right child of P and if N is the right child of P, we make C the left child of P   none of the above