L$.$ Ghemri

Exercise $6$ : $($Extra credit$)$

Starting with an empty binary search tree, nodes with keys F$,$I,N$,$ A$,$ L and S are inserted into the tree in that order. Draw the tree produced.