If we exclude isomorphic trees (see Exercise C-8.35), exactly how many proper binary trees exist with exactly 4 leaves?   Add support in LinkedBinaryTree for a method, _delete_subtree(p), that removes...

If we exclude isomorphic trees (see Exercise C-8.35), exactly how many

proper binary trees exist with exactly 4 leaves?

Add support in LinkedBinaryTree for a method, _delete_subtree(p), that

removes the entire subtree rooted at position
p, making sure to maintain

the count on the size of the tree. What is the running time of your implementation?