Tree for intervals

Insert the following intervals into a complete binary search tree $($choose the root as the midpoint in each division$).[1,4],[2,6],[3,7],[5,9],[8,13],[10,15],[11,14]$

Draw a picture of the tree and show which nodes will be examined when searching for the points $9\mathrm{.}5$ and $11\mathrm{.}5.$