Suppose you had a Binary Tree of Strings with the following strings separated by commas added (using the add method) in the order given (first one written below is added first, etc.) "G", "F", "E", "D", "C", "B", "A" What would the resulting tree look like? / is used for a left child and is used for a right child, with root depicted at the top of the tree. a D / F B E GA O A B C D E F G O F E V D C B A G F / E / D C 1 B / A