CSCI 161 Bonus Lab: sections S26N01/2

It is assumed you are keeping up to date with the lectures and labs.
Some additional git information is available through the git quick notes, git project/lab submission, and lecture resources pages.

In this lab we start working with C++ classes, using them to build our own linked list class and then use that class in a small application.

Be sure to follow the course code standards. Marks will be deducted for failing to follow standards.

bonus lab product requirements/specification/design

• You're implementing a (public) remove method, so the user can identify specific bugs to remove from the tree and delete.

        // finds, removes, and deletes the bug with the provided name,
        //    but still leaving the tree in a valid form
        // returns true if successful, false otherwise
        // (uses the protected remove method to do the actual work)
        bool remove(string name);
  

• You're implementing an overloaded (public) assignment operator, so the user can also use syntax like b2 = b1; for bugtrees.

        // overloaded = operator, copies content of bugtree b into current (duplicates data)
        // (uses copyAllFrom to do the work)
        bugtree& operator=(const bugtree& b);
  
  

• To support the methods/functions listed above, you're also implementing a handful of new protected methods:

        // finds and removes the bug with the specified name from the subtree b,
        //    while leaving the tree in a valid binary search tree form
        // returns true if successful, false otherwise
        bool remove(string name, bug* &b);
  
        // returns a pointer to the bug with the alphabetically 'lowest' name
        //    from within the subtree b (null if b is null)
        // largest does similarly for the alphabetically 'highest' name
        bug* smallest(bug* b);
        bug* largest(bug* b);
  
        // goes pre-order traversal of subtree b (b, then b's left, then b's right)
        //    and on each b it inserts a bug with b's name/desc/file
        //    into the current true (takes b's data and calls insert)
        // returns a count of the number of bugs successfully copied
        int copyAllFrom(bug* b);