Part 3: Binary Search Tree for the MoviePlaylists (20pts)Ī Binary Search Tree that stores all the Playlists in your repository, this is the The system determines the most Movies that can fit into the PlayList from all the available movies. The user specifies the total runtime of the PlayList Note that the same Movie can exist in different PlaylistsĮnforce that the same Movie cannot exist in the same PlaylistĪn algorithm that automatically populates a MoviePlayList with movies based on the Maximum Runtime of the Playlist You should make the Review and MoviePlay Lists now as a Templates. 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 Part 2: RunTime PlayLists of Movies (25pts) Private pointer to the root of the tree and a count of the number of movies in the treeĪ function to read the movies from a file and load them into the MovieTree Remember that the Movies are referenced through pointers in the tree nodes. Only the MovieList is scrapped in favor of the BST The Movies remain the same with their internal Review Lists from Lab 4. Part 1: Binary Search Tree for the Movies (25pts)Ī 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īasically you are replacing the order linked list from Lab 4 with a Binary Search Tree
This should be in pseudo-code or flowcharts, not just the code you ended up writing You need to provide a report that shows (20pts): In this assignment, you are going to complete your movie library, using Lab 4 as a starting point.
0 kommentar(er)
