Question 4 a. A balanced binary search may be balanced or unbalanced based on the arrangement of the nodes of the tree. With you knowledge in Binary search tree: i. Explain the best and worst case...

Question 4
a. A balanced binary search may be balanced or unbalanced based on the arrangement of the

nodes of the tree. With you knowledge in Binary search tree:
i. Explain the best and worst case scenarios of the time and space complexity of both

type of binary trees above.

ii. Using your own binary tree,

a. perform an inorder, preorder and a postorder traversal

b. provide the algorithm for the traversals above