$($a$)$ Insert items with the following keys $($in the given order$)$ into an initially empty

binary search tree: $30,40,24,58,48,26,11,13.$

Draw the tree after all insertions.

$($b$)$ Delete $24$ from the resulting tree and draw the final tree after deletion.

$($c$)$ For each of the algorithms PreorderTraversal, InorderTraversal, and

PostorderTraversal answer the following questions:

$1.$ Does the algorithm print the keys of elements stored in a binary search tree in

a sorted order? Why or why not?