Time lef

The following numbers are inserted into an empty binary search tree in the given order $10,1,3,5,15,12,16.$ What is the height the binary search tree $($the height is the maximum distance of a leaf node from the root$)$

Oa $2$

Ob$.4$

c$3$

Od $5$

Clear my choice