Given an empty binary search tree, show the binary search at the following check points $($operations are done above each other$).$

inserting $20,12,95,7,52,16,8,64,81,110$check point $1)(2$ points$)$

deleting $95,16($check point $2)(2$ points$)$

inserting $73$ and $18,$ then remove $20($check point $3)(3$ points$)$