Since your working on the other code... this assignment is an add on would you be able to help on this one too? Modified Binary Tree repo: https://classroom.github.com/a/IIQnhNYg points: 10 Modi
5/7/2021 HW40 https://loyno.instructure.com/courses/5769/assignments/160598?module_item_id=426779 1/3 Details HW40 5/7/2021 –/10 Points Calculated by: Most RecentModified Binary Tree repo: https://classroom.github.com/a/IIQnhNYg ( h ttp s://c la ssro om .g it h ub.c o m /a /IIQ nhN Yg) points: 10 Modify the previous program to create and manipulate a little more complicated binary tree. Y ou need to have the previous assignment fully working to begin this one! Let me repeat: you cannot get credit for this assignment unless the previous one has been submitted and is correct! This time, instead of just a boring number, it stores names (text) and ages (a number value). Use the string name to determine the location on the tree (i.e. the name is now the value for each node and the order is determined alphabetically!). Simply store the age with the number for the purposes of displaying. Note: Test your program with the given driver in the output below (you will have to update it from the previous program). Also, sorting strings alphabetically is rather easy (same as integers). But there is a dif ference between upper and lower case letters... Recall which comes first! Keep the dif ference (note Wilma and wilma below). Also, you will need to look at the output below to figure out the proper order of the functions to call. This shouldn't be too difficult, but you will need to think about it... When you turn in your code, also answer the following:1. How would you go about true alphabetizing (case insensitive)? What functions would you have to manipulate and how? 2. Draw out (by hand or using ASCII art) the final version of the binary tree. This is after all insertions and deletions and insertions and such. (Hint: this is a very good thing to have handy while you are writing the program). The output should look something like this: Binary Tree! Inserted node value of Barney (87) Inserted node value of Wilma (63) Inserted node value of Bamm Bamm (13) Inserted node value of Pebbles (92) Inserted node value of Gazoo (98) Inserted node value of wilma (87) 5/7/2021 HW40 https://loyno.instructure.com/courses/5769/assignments/160598?module_item_id=426779 2/3Inserted node value of Dino (5) Inserted node value of Pearl (52) Displaying nodes in order: Bamm Bamm (13) Barney (87) Dino (5) Fred (52) Gazoo (98) Pearl (52) Pebbles (92) Wilma (63) wilma (87) Displaying nodes in PRE order: Fred (52) Barney (87) Bamm Bamm (13) Dino (5) Wilma (63) Pebbles (92) Gazoo (98) Pearl (52) wilma (87) Displaying nodes in POST order: Bamm Bamm (13) Dino (5) Barney (87) Pearl (52) Gazoo (98) Pebbles (92) wilma (87) Wilma (63) Fred (52) Node Bozo NOT found! Node Wilma WAS found! Displaying nodes in order: Bamm Bamm (13) Barney (87) Dino (5) Fred (52) Gazoo (98) Pearl (52) Pebbles (92) Wilma (63) wilma (87) Attempting to delete node Barney Deleting node Barney (87) children on both sides Looking at node Dino Attempting to delete node wilma Deleting node wilma (87) with no children Displaying nodes in order: Bamm Bamm (13) Dino (5) Fred (52) 5/7/2021 HW40 https://loyno.instructure.com/courses/5769/assignments/160598?module_item_id=426779 3/3Gazoo (98) Pearl (52) Pebbles (92) Wilma (63) Thank you!
You must use the repo from the link from each assignment to start and submit your work. You must include the standard header and comments in your source code for all of your files that you submit.
Compile, run, and test your program. Make sure there are no errors and it functions properly . You can hit [Ctrl or command]+[Shift]+B to compile and run the program. Y our program must run without errors to get full credit! Assignments that do not compile will not be graded. Commit and push (upload) your repo, including all of your program source files to the base directory of the repo in GitHub for grading. Files must be named correctly and saved as a readable files with the proper extension . You must follow any given input/output constraints to get full credit for your work. I will not accept any programs that use prefix notation for incrementing or non-specific data types (like var and auto). Programs must adhere to common formatting conventions for the programming language you are using.
