Please fill in to-do 15 #ifndef _operations_hpp_ #define _operations_hpp_ #include #include #include #include #include #include #include #include "book.hpp" struct remove_from_bst { // Function takes a constant Book as a parameter, finds and removes from the // binary search tree the book with a matching ISBN (if any), and returns // nothing. If no Book matches the ISBN, the method does nothing. void operator()(const Book& book) { ///////////////////////// TO-DO (15) ////////////////////////////// // Write the lines of code to remove the book from "my_bst" that has an ISBN // matching "book". /////////////////////// END-TO-DO (15) //////////////////////////// }
Please fill in to-do 15
#ifndef _operations_hpp_
#define _operations_hpp_
#include <forward_list>
#include <list>
#include <map>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#include "book.hpp"
struct remove_from_bst {
// Function takes a constant Book as a parameter, finds and removes from the
// binary search tree the book with a matching ISBN (if any), and returns
// nothing. If no Book matches the ISBN, the method does nothing.
void operator()(const Book& book) {
///////////////////////// TO-DO (15) //////////////////////////////
// Write the lines of code to remove the book from "my_bst" that has an ISBN
// matching "book".
/////////////////////// END-TO-DO (15) ////////////////////////////
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
