Binary Tree - Part 7

Which of the following BSTs results from inserting the letters I N TE G R A L (in that order) into an initially empty BST? A. B. C. D. A B C D Suppose a binary search tree has all levels filled to capacity. When we remove the * root of such a tree, which of the following can take its place so that the tree remains a BST? Either the right or the left child of the root Either the rightmost leaf or the leftmost leaf Either one of the two nodes in the middle of the bottom level None of the above