(c) (8 points) (You must submit code for part of this question!) Use the framework below to describe how you would recursively implement the following methods of a Binary Search Tree. Afterwards, submit an implementation of all of the methods in your Github. Note that the Rec suffix simply means that the function is recursive. 1. insert Rec 2. deleteRec 3. findNextRec 4. findPrevRec 5. findMinec 6. .findMaxRec You must submit answers to all of the below questions for full credit!! Feel free to keep the answers as short or as long as you need to - you definitely don't need to write more than a couple of sentences for each one. i. Repeat the question in your own words. List assumptions you make about the requirements. ii. Enumerate edge cases that you will want to consider. In this assigment, you don't have to write code to address those as long as you call them out here. iii. Illustrate examples of input and output. iv. Come up with an algorithm for each method. You don't need to submit any thing for this part, but I strongly recommend doing this before starting to code." v. Identify whether there are any issues with performance or space in your algo rithm, and if so, iterate on it until it's as optimized as possible. If you're stuck here, please ask for help during Office Hours or on Slack!!! vi. (You must submit code for this question!) Translate your algorithm into real code. For this exercise, please do so in an IDE and upload it to Github. Add the suffix Rec to all of your recursive methods. For example, your recursive implementation of insert should be called insertRec(). vii. What are problems/trade-offs with your current method? How might you op- timize it to prevent those issues? You don't have to optimize them here, but you must enumerate them. (c) (8 points) (You must submit code for part of this question!) Use the framework below to describe how you would recursively implement the following methods of a Binary Search Tree. Afterwards, submit an implementation of all of the methods in your Github. Note that the Rec suffix simply means that the function is recursive. 1. insert Rec 2. deleteRec 3. findNextRec 4. findPrevRec 5. findMinec 6. .findMaxRec You must submit answers to all of the below questions for full credit!! Feel free to keep the answers as short or as long as you need to - you definitely don't need to write more than a couple of sentences for each one. i. Repeat the question in your own words. List assumptions you make about the requirements. ii. Enumerate edge cases that you will want to consider. In this assigment, you don't have to write code to address those as long as you call them out here. iii. Illustrate examples of input and output. iv. Come up with an algorithm for each method. You don't need to submit any thing for this part, but I strongly recommend doing this before starting to code." v. Identify whether there are any issues with performance or space in your algo rithm, and if so, iterate on it until it's as optimized as possible. If you're stuck here, please ask for help during Office Hours or on Slack!!! vi. (You must submit code for this question!) Translate your algorithm into real code. For this exercise, please do so in an IDE and upload it to Github. Add the suffix Rec to all of your recursive methods. For example, your recursive implementation of insert should be called insertRec(). vii. What are problems/trade-offs with your current method? How might you op- timize it to prevent those issues? You don't have to optimize them here, but you must enumerate them
