BINARY SEARCH TREES

a$.$ Name at least $2$ ways of implementing a Binary Search Tree. At least one method

can use data structures already learnt in this course. Explain what the advantages

and disadvantages of these approaches are.

b$.$ Begin with an empty BST and insert the following nodes:

$4,86,-37,47,-74,-58,92,-31,9,77,-6$

Delete the following nodes and show the tree after each deletion:

$-37,47,9,4$