Part $2$: Implementing a Binary Search Tree

In the beginning, this course will be mostly centered around Binary Search Trees $($BSTs$).$ Recall that, in addition to utilizing the basic functionality of a BST$,$ one can also iterate over the elements of a BST in ascending order by starting at the left$-$most node in the BST $($which contains the smallest element$)$ and finding the successor of each node one$-$by$-$one. In this part of the PA$,$ you will exercise your understanding of BSTs by implementing the standard functions of a BST$.$