You are given an empty binary search tree T and an array of strings:

{apple, banana, pear, watermelon, cherry, algorithms are fun,'lol','cool','next','tea}

Draw the tree T after each of the strings is inserted into it