| CPSC 327 | Data Structures and Algorithms | Spring 2024 |
For both problems, show the tree after each insertion or removal and not only the final result. Also, the operations should be cumulative — each new insertion/removal is applied to the tree resulting from the previous operations.
For removal, the problem specified swapping with the successor.