$6.$ Draw the BST that is created by inserting the following nodes$/$values in the given order

into a BST that is initially empty, $37895216.$ Draw the resulted tree after each step.

$7.$ Write a pseudocode to traverse the BST of Question $5$ in post$-$order. Print the nodes in

traversing order.

$8.$ The average case time complexity of a BST is O$($logn$).$ Explain with an example.