Solved–A Movie Repository II: Movies, Playlists, and Search Trees Lab #6– Solution

Description

In this assignment, you are going to complete your movie library, using Lab 4 as a starting point.

You need to provide a report that shows (20pts):

1. Your class designs

2. The algorithms used

1. 1. This should be in pseudo-code or flowcharts, not just the code you ended up writing

3. Compiling instructions

4. Sample runs (screenshots are fine)

Things to have (80pts):

Part 1: Binary Search Tree for the Movies (25pts)

1. A Binary Search Tree that stores all your Movies for the entire library, this is the MovieTree and is the main repository for your movie library

1. 1. Basically you are replacing the order linked list from Lab 4 with a Binary Search Tree

1. 1. 1. The Movies remain the same with their internal Review Lists from Lab 4.

1. 1. 2. Only the MovieList is scrapped in favor of the BST

1. 2. Movies are sorted by movie title.

1. 3. No duplicates are allowed.

1. 4. Remember that the Movies are referenced through pointers in the tree nodes.

1. 5. Private pointer to the root of the tree and a count of the number of movies in the tree

1. 6. A constructor and destructor for the BST

   7. The following public methods:

1. 1. 1. void addMovie(Movie *s);

      2. Movie *findMovie(string title);

1. 1. 3. int getDepth();

1. 1. 4. int getNumMovies();

   2. void printTree(bool ascending=true);

2. A function to read the movies from a file and load them into the MovieTree

Figure 1 BST of Movies

Part 2: RunTime PlayLists of Movies (25pts)

3. A PlayList for Movies, MoviePlayList

3. 1. This is a simple linked-list similar to the one you used for the Reviews in Lab 4 except that the Movies in the playlist nodes are pointers to the Movies

3. 1. 1. You should make the Review and MoviePlay Lists now as a Templates.

3. 2. Note that the same Movie can exist in different Playlists

3. 3. Enforce that the same Movie cannot exist in the same Playlist

3. 4. Not all Movies have to be in a Playlist

   5. Each MoviePlayList also has a title

3. An algorithm that automatically populates a MoviePlayList with movies based on the Maximum Runtime of the Playlist

3. 1. The user specifies the total runtime of the PlayList

3. 2. The system determines the most Movies that can fit into the PlayList from all the available movies.

Part 3: Binary Search Tree for the MoviePlaylists (20pts)

5. A Binary Search Tree that stores all the Playlists in your repository, this is the

PlaylistTree

5. 1. The nodes of this tree use pointers to the Playlists to reference them

5. 2. The tree is sorted by Playlist title

5. 3. No duplicates are allowed

5. A function to read the playlists from a file, playlists.txt, create the Playlists and create the PlaylistTree (10pts)

Figure 2 Binary Search Tree of Playlists

Part 4: Menu (10pts)

7. A menu to allow the user to interact with the system. It should allow (30pts):

7. 1. Main

      1. Load Movies from file

7. 1. 2. Load Playlists from file

7. 2. Songs

      1. List all Movies

7. 1. 2. Search for Movie by title

7. 3. Playlists

      1. List all Playlists

7. 1. 2. Search for Playlist by title

      3. List Movies for Playlist

7. 1. 4. Create Playlist

7. 1. 5. Save Playlists

   2. Exit

Extra Credit: (do option 1 OR option 2, no extra will be given for both)

Option1: Implement Polymorphic Trees (10pts)

Instead of creating two different tree class (one with Movie pointers and one with Playlist pointers), create an abstract superclass with Movie and Playlist as subclasses. Create one tree class that uses pointers to this superclass. Implement a polymorphic compare method for the use by the Tree.

Option2: Implement Genres (10pts)

These are similar to Playlists, but hold related Movies based on Genre. You also need to add another Binary Search Tree for Genre, GenreTree.

Update the menu to allow for Listing/Searching Genre, and the RunTime Playlists to allow specification of Genre in addition to total runtime.