BST $($Binary Search Tree$)$:

Construct the BST for the following list of keys on your paper: $24,36,14,21,11,27,41,19,5,30,23,35,8$

Draw the BST one step at a time, every insertion of $1$ node.

Search for node $30,11.$ Draw the BST and highlight the traversed path in searching the $2$ nodes. $1$ BST drawing for each

node.

Delete node keys $35,27,24,$ in that order. Draw the resulting BST for each delete operation.