Sample space of n consecutive coin flips Taking a positive integer n as input, print the sample space of n consecutive coin flips. The coin is fair, with two sides H and T, each with probability 0.5.
For example,
Input - 3
Output -
HHH
HHT
HTH
HTT
THH
THT
TTH
TTT

Rules

Standard loopholes apply
You may print the elements out of order, but all of them should be present.
You may use any form of output, as long as heads and tails are displayed as 'H' and 'T', and all elements are distuinguishable.

This is code-golf, so the shortest code in bytes wins. Good luck!
Jelly, 4 bytes
⁾HTṗ

A monadic Link accepting a non-negative integer which yields a list of characters.
Try it online! (footer calls the Link and joins with newline characters)
How?
⁾HTṗ - Link: integer, n
⁾HT  - list o characters = ['H', 'T']
   ṗ - (that) Cartesian power (n)