You are given an empty binary search tree T and an array ofstrings:
{“apple”, “banana”, “pear”, “watermelon”, “cherry”, “algorithmsare fun”,’lol’,’cool’,’next’,’tea}
Draw the tree T after each of the strings is inserted intoit
Expert Answer
An answer will be send to you shortly. . . . .