Q$5$: Construct a Binary Search Tree $($BST$)$ by inserting, one at a time, the following nine elements:

$(3$ points$)$

$7,10,2,15,12,1,8,14,4$