Question: Question () Draw a complete Binary Search Tree that contains the 14 nodes of values: A, B, D, G, H, J, K, M, P, R,

Question () Draw a complete Binary Search Tree that contains the 14 nodes of values: A, B, D, G, H, J, K, M, P, R, T, V, X, and Z. (1 mark) (b) Give one possible order in which these nodes should be inserted to produce the Binary Search Tree drawn in part (a) above. (1 mark) (c) How many Binary Search Trees of minimum height can contain the same 14 nodes in part (a)? Justify your answer ie., explain your reasoning clearly. There is no need to draw the various solutions. (2 marks) (d) Can a complete Binary Search Tree be balanced? Explain. (2 marks) (e) Which well-known algorithm could you use to construct a balanced Binary Search Tree from a Sorted Array. Explain the approach. (2 marks)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
