Implement the tree ADT using the binary tree representation described in Exercise C-8.43. You may adapt the LinkedBinaryTree implementation.   How long would it take to remove the log n _ smallest...

Implement the tree ADT using the binary tree representation described in

Exercise C-8.43. You may adapt the LinkedBinaryTree implementation.

How long would it take to remove the logn_ smallest elements from a

heap that contains
n
entries, using the remove min operation?

Suppose you label each position
p
of a binary tree
T
with a key equal to

its preorder rank. Under what circumstances is
T
a heap?