in a(n) , the element j to be removed is always at the root. a. binary heap b. avl tree c. binary search tree d. binary tree