in java Draw the binary search tree that results from inserting $($in the following order$)$ these

numbers: $[8,15,16,18,9,10,17,14].$

$($a$)$ Is this a balanced tree?

$($b$)$ What is the order in which these nodes are visited by a post$-$order traversal?

$($c$)$ What is the order in which these nodes are visited by a breadth$-$first traversal?

$($d$)$ If $15$ is removed, which node will replace it$?$

$($e$)$ How many operations will it take to determine that $6$ is not in the tree?