Names

Given an empty Binary Search Tree of Strings called myTree, defined as:

Treeadd$()$ myTree.add$(Lemon)$;

myTree.add$(Cherry)$;

myTree.add$(Raspberry)$;

myTree.add$(Mango)$;

myTree.add$(Orange)$;

myTree.add$(Watermelon)$ ;

myTree.add$(Banana)$;

myTree.add$(Grape)$;

myTree.add$(Fig)$;