each sequence represents a pre-order traversal of a tree. each letter is the label of a vertex. internal vertices are labeled with lower-case letters and leaves are labeled with capital letters. furthermore, the tree has the property that every internal vertex has exactly two children. give a tree t such that a pre-order traversal of t visits the vertices in the order given. for example, the sequence a, a, b would correspond to the tree: