Inspired by Fibonacci domino tiling, this problem is about generating ASCII art representing another famous combinatorial sequence.
A n-step mountain diagram is a drawing of a mountain range, using exactly n '/' and n '\' characters, such that characters sketch a continuous curve which never dips below its initial "altitude". For example,
/\/\ /\/ \
/\ /\/ \/\
are both 4-step mountain diagrams, but
/\ /\/\ \/
The program should accept an integer n from stdin or as the parameter to a function.
Print all n-step mountain diagrams to stdout. The diagrams can be in any order, but should be separated by some sort of whitespace. You can decide if different diagrams will be output horizontally, vertically, etc.
As in the domino tiling problem, you can use whatever whitespace you want. This includes extra newlines before or after the printed output.
Some sample valid outputs for n=3:
Valid output A:
/\ /\ /\ / \ /\/\ /\/\/\ / \/\ /\/ \ / \ / \
Valid output B:
/\ /\/ \ /\/\ / \ /\/\/\ /\ / \ / \ /\ / \/\
Valid output C:
/\ / \ /\ / \ /\/ \ /\/\ /\ / \ / \/\ /\/\/\
This is code golf; shortest program (in bytes) wins.