C++ Code:

Read a single integer from the keyboard. Assume this integer represents the number of times you want to flip a coin (with two sides: H and T for heads and tails respectively). Show all possible outcomes of H and T for flipping the coin this many times.

You must use recursion for this problem. You may not use any loops (or goto) to solve this.

Example 1:

Coin flips?

User input: 1

Output:

T

H

Example 2:

Coin flips?

User input: 2

Output:

TT

TH

HT

HH

Example 3:

Coin flips?

User input: 3

Output:

TTT

TTH

THT

THH

HTT

HTH

HHT

HHH