Representation of permutations, combinations and dihedral elements as trees

AbstractPermutations and combinations of n objects as well as the elements of the dihedral group of order 2n (i.e. flips and rotation of an n-gon) are represented as nodes of trees. The algorithms for generating the nodes and traversing the trees are illustrated using flowcharts and specific walk-throughs for given values of n. Any programming language that allows recursive calls can be used to implement these algorithms