What you need to accomplish in this lab:

Implement a (2,4)-Tree store objects with the following interface:

class TwoFourTree {
  public:
    TwoFourTree(); // create an empty (2,4)-tree
    ~TwoFourTree(); // delete data along while deleting nodes
    bool insert(int, string); // return false if found duplicate 
    // return false if no such key
    // return true and set the parameter to data if found
    bool lookup(int, string &);
  private:
    // fill your data types and data fields and help methods here
    // parent pointer is optional
    ...
};

Submit your work using the submit name Lab7.