Consider inserting the following sequence of integers into an empty BST:

A$,18,10,20,5,8,9,$ B

You pick integers for A and B without generating any duplicates in the list. show your

sequence after A and $B$ are replaced by your choice of integers.

d$.$ Evaluate the Balance factor for each node according to your textbook. $[5$pts$]$

f$.$ Describe the search algorithm for node $9$ in this BST$.$ How many comparisons are done

before finding node $9?[4$pts$]$

g$.$ Describe the algorithm for removing node $18$ from the tree. $[4$pts$]$