Define Binary Search Tree$($BST$)$

Given the sequence of number $(3,5,2,7,1,4,8,9,12)$ construct BST

Explain how can you delete a node with the value $2$ and how will be BST $?$