Show the final tree only after inserting
10, 20, 30, 25, 35, 40, 11, 28, 65, 60, 54, 75, 47, 14, 15, 16, 17
into a binary search tree.
show step by step of the change of a queue used to do breadth-first print of the tree.
now insert 18 into the tree and then use dsw algorithm to show step by step of right rotations that creates the backbone tree and step by step of making the tree balanced.

Hassan is writing his master’s thesis, which is a thirty-page document. he received some feedback from his professor in the form of comments, but does not see where the comments are. what is the fastest way for hassan to find the feedback?

Melissa needs to add a topic to an email that she will send to her teacher. choose the name of the field where she should type her topic.

Multiple choice project create a program with two multiple choice questions. 1. users have two attempts only, show attempt number each time. hint: while loop with break control. (20%) 2. only one correct answer for each question, use switch case for each question. (20%) 3. show total score after the two questions are answered. hint: . (20%) 4. user have options to answer the two questions again if first attempt score is not 100%. hint: if statment. (20%) 5. use string method .toupper() to allow users to enter with lowercase or uppercase letters. (20%) 1. where is the capital of the state of florida? a. orlando b. tallahassee c. miami d. tampa b 2. where is walt disney world park located in florida? a. orlando b. tallahassee c. miami d. tampa a