Binary search tree $(25$pts$)$

Given a list of items, take items one by one using your list iteration procedure.

Table $1-$ Items

$1.$a$.$ Insert all items into a binary search tree and draw the tree $(15$pts$)$

$1.$b$.$ Delete the root node and redraw the tree $(10$pts$)$