Lookup with BST. You may have realized by now that BSTs are great for implementing lookup structures. As such, in this question, we wish to implement a Set using Binary Search Trees. You can assume you have a bst container with methods to support search, insert, delete and traverse. Given below are the headers to a C++ Set class and the bst container (implementation details omitted):

Lookup with BST. You may have realized by now that BSTs are great for implementing lookup structures. As such, in this question, we wish to implement a Set using Binary Search Trees. You can assume you have a bst container with methods to support search, insert, delete and traverse. Given below are the headers to a C++ Set class and the bst container (implementation details omitted): template class Set [ private: :template class bst ( :/member variables, etc public: :I/ returns true if found, false if not // standard BST implementation bst *tree : bool search (const T& value) public: Set ) // overwrites if duplicate void insert (const T& value) tree- new bst / true if deleted, false if not if // insert will add an element to the BST // if the BST does not already contain it; // returns: true if inserted, nt to the BST/7 ; bool delete (const T& value); II values from in-order traversal Ealse if already in tree : vector traverse) bool insert (const T& value)