c++ project data structures

Implement: the [login to view URL] namespace main_savitch_chapter10{ template <class Item> binary_tree<Item>::binary_tree( ){ } } A function that checks if the binary tree is a binary search tree: bool isBST() A function that checks if the binary tree is a max or min heap: bool isHeap(std::string htype) called with either isHeap('min') or isHeap('max') these functions can either be completed as part of the bt_class or as standalone functions. If the latter, the signature can be modifed to accept the root node of the binary tree.