Here is a binary tree with 16 leaves. Two of them are green. The rest are red. Your job: find the two green ones. But first -- try building a few strings yourself and see how many turn green.
For n=2, you build every string of 4 characters by choosing ( or ) at each position. How many total strings is that?