1. Suppose that a binary decision tree for set membership is labeled consistently (i.e., "left" indicates an element is in the set and "right" indicates an element is not in the set). What subset will be assigned to the leftmost leaf? . . . the rightmost leaf?
2. Consider a language with only two letters (a and b), and a binary decision tree that encodes dictionary ordering for short words (no more than five letters long) in this language. What is the practical meaning indicated by the tree being incomplete?