(Solved): Binary Search Trees:- 4 - We are constructing a BST from scratch. Draw the resulting tree after e ...

Binary Search Trees:-

4 - We are constructing a BST from scratch. Draw the resulting tree after every remove operation. (25 points) Note: if a removal operation can be performed in two different ways resulting in two different trees after removal, please draw both possible solutions. insert(D), insert(C), insert(B), insert(A) remove \( (\mathrm{C}) \) insert(F), insert(E), insert(G) remove(D)