if the number of children of an internal vertex can be one or two, does each sequence correspond to a unique tree? that is, is it possible to have two different trees whose pre-order traversals result in the same sequence? (capital letters must be leaves and lower-case letters must be internal vertices.)