int main(){ BSTree<double> bstree; bstree.insert(34); bstree.insert(56); bstree.insert(3); bstree.insert(89); bstree.insert(12); bstree.insert(22); bstree.insert(78); int target = -1; cout << "Data to look for:" ; cin >> target; Node<double>* result = bstree.binary_search(target); if(result){ cout << "Found result(" << result->get() << ")" << endl; }else{ cout << "Nothing is found" << endl; } }