Show how the following values would be inserted into an empty

binary search tree, and then keep deleting the oldest node in the

tree until all nodes are deleted $($i$.$e$.$ delete $84$ first, then $55$ etc.$)$

Show how the structure of the tree is updated following each

deletion.