Very simple project. Need the following binary search program "[url removed, login to view]" modified with the following two parts:
1. Modify the program so that every node has an additional third child, called mid. Modify the insert program, so that the value is stored in the middle child if it has the same value as its parent.
2. Insert the following numbers 6, 12, 18, 24, 8, 16, 24, 5, 10, 15, 7, 14, 21, 4 in this ternary tree. Ask the user to search for a number. If the number is there, return "yes", otherwise return "no".
[url removed, login to view] an excel spreadsheet, form a chart with 3 columns which include the name, director and the date (year) of 25 of your most favorite movies. (Use IMDB!).
[url removed, login to view], our goal is to form a ternary search tree for the movies you picked, by modifying the algorithm you wrote in Assignment 1 as follows:
(a) Create a data structure (using struct) called movie, which has 6 members: a string for the name of the movie, another string for the director, an integer value for the year, and 3 pointers: left, mid, right.
(b) Modify the CreateNode and Insert functions; instead of mydata (int), you should have 3 inputs: movie name (string), movie director (string), and year (integer).
(c) Modify the search function, by replacing data with the year of the movie (namely, search for the year!).
(d) Inside the main function, add the 20 movies you picked to your tree, using the insert function.
(e) Your program should do this: Ask the user to search for a year. If there is a movie shot that year, it should return a message that gives the name and the director of the movie. If there isn't a movie shot in that year, the program should return "not found".