Use the binary search tree below and evaluate how you could remove the root node $55.$

For each possible removal, state whether it is a valid removal approach using one of the two algorithms from the lecture n$$tes and videos discussed in Module $12.$

A removal can either be:

valid: the removal uses one of the two algorithms and creates a binary search tree

invalid: either

a$)$ the removal does not use one of the two algorithms or

b$)$ the removal results in a tree that is no longer a binary search tree

Assume the tree is as shown in the picture below for each removal. $($In other words, the root has not yet been removed.$)$

remove $55$ and replace with $30$

remove $55$ and replace with $40$

remove $55$ and replace with $25$

remove $55$ and replace with $45$

remove $55$ and replace with $62$

remove $55$ and replace with $70$

remove $55$ and replace with $75$

remove $55$ and replace with $60$