Question: 8. a) Sketch a binary search tree containing ALL of the following English names, and rooted at the name Mae: Zoe, Olivia, Rachel, Emily,

8. a) Sketch a binary search tree containing ALL of the following

8. a) Sketch a binary search tree containing ALL of the following English names, and rooted at the name Mae: Zoe, Olivia, Rachel, Emily, Mandy, Dora, Phoebe, Mae, Kit, Denise b. What is the size of the tree in your answer to part (a)? c. Assume that an empty tree has a height of 0. What is the height of the tree in your answer to part (a)? o marks) d. Is the tree that you sketched for part (a) a balanced tree? Making reference to the definition of balanced tree, justify your answer. o marks) e. Explain how the method remove would work when removing Mae from your binary search tree in part (a). Sketch the resulting tree. o marks)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a please check figure 1 attached for the binary search tree 1 root word Mae 2 compare 1st character ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Algorithms Questions!