Implement your BST including following functions: $(1)$ Constructor, $(2)$ insert$(0.(3)$ remove, $(4)$ PrintTree$((5)$ GetMin$()$ and GetMax$0-$ to find the smallest or largest values stored the BST$,$ etc.

Create a driver $($main$)$ program to integrate functions$/$classes and run the test case below:

$-$ create a BST tree using the input of $\backslash ([12,6,17,19,21,11,3,5,4,24]\backslash )$

$-$ print tree

$-$ add $[10]$

$-$ print tree

$-$ remove $[6]$

$-$ print tree

$-$ print the smallest value

$-$ print the largest value