// output of ./demo/comb/schroeder-tree-demo.cc: // Description: //% Generate all Schroeder trees with m-leaf nodes, loopless algorithm. arg 1: 5 == m [Generate all m-leaf trees] default=5 k=1: 1: 5 0 k=2: 2: 4 2 0 0 0 0 3: 4 2 0 0 1 0 4: 4 2 0 1 0 0 5: 4 2 1 0 0 0 6: 3 3 0 0 0 7: 3 3 0 1 0 8: 3 3 1 0 0 9: 2 4 0 0 10: 2 4 1 0 k=3: 11: 3 2 2 0 0 0 0 12: 3 2 2 0 0 1 0 13: 3 2 2 0 1 0 0 14: 3 2 2 0 1 1 0 15: 3 2 2 0 2 0 0 16: 3 2 2 1 0 0 0 17: 3 2 2 1 0 1 0 18: 3 2 2 1 1 0 0 19: 3 2 2 2 0 0 0 20: 2 3 2 0 0 0 0 21: 2 3 2 0 0 1 0 22: 2 3 2 0 1 0 0 23: 2 3 2 1 0 0 0 24: 2 3 2 1 0 1 0 25: 2 3 2 1 1 0 0 26: 2 3 2 2 0 0 0 27: 2 2 3 0 0 0 28: 2 2 3 0 1 0 29: 2 2 3 1 0 0 30: 2 2 3 1 1 0 31: 2 2 3 2 0 0 k=4: 32: 2 2 2 2 0 0 0 0 33: 2 2 2 2 0 0 1 0 34: 2 2 2 2 0 1 0 0 35: 2 2 2 2 0 1 1 0 36: 2 2 2 2 0 2 0 0 37: 2 2 2 2 1 0 0 0 38: 2 2 2 2 1 0 1 0 39: 2 2 2 2 1 1 0 0 40: 2 2 2 2 1 1 1 0 41: 2 2 2 2 1 2 0 0 42: 2 2 2 2 2 0 0 0 43: 2 2 2 2 2 0 1 0 44: 2 2 2 2 2 1 0 0 45: 2 2 2 2 3 0 0 0 ct=45