Corrections to Review Questions for Exam 1

> Question 26: Asymptotic time performance should be for the
    average cases

> Question 33:  Should be "perfect binary tree", not  "full binary tree".

> Question 35:  Should be "full binary tree", not "binary tree".
 
> Question 41:  Signature of BST::Search method should have reference
    to bool, not just bool.  Also, parameter u should be of type
    Bnode<Etype>, not Bnode<T>

  template <class Etype>
  Bnode<Etype> *
  BST::Search(Bnode<Etype> * u, const Etype & value, bool & success) const;

> Page 12:  Definition of SlList class should have a Delete method
    bool Delete(int)