Problem $2.($a$)$ Show the result of inserting $5,1,7,11,15,4,9,12$ into an initially empty binary search tree.

$($b$)$ Show the result of deleting the element at the root. $($IN JAVA OR C$++)$