On a standard binary tree, what would the data structure look like if we inserted the following names into the tree, supposing that names are compared in a standard lexicographic order:

Isaac, Henrietta, Nigel, Buford, Jethro, Cletus