Keys $=$ E X A M I N C T D O S

If you entered the above keys, in the order shown, into an initially empty binary search tree, then the key at the root vertex would be $[$w$]$ and the keys at the leaf nodes would be $[$x$],[$y$]$ and $[$z$].$

Draw the binary tree on paper $($if required$)$ and write the values of $[$w$],[$x$],[$y$]$ & $[$z$]($in this order, one per line$)$ in the text area below.