// output of ./demo/comb/ordered-tree-branches-demo.cc: // Description: //% Ordered trees with n non-root nodes by branches: //% branch lengths are a composition of n (array a[]) and //% branch heights (height of base of branch, array b[]) are such that //% b[j] < a[j-1] + b[j-1] for j>=2 (and b[1]=0). arg 1: 5 == n [number of non-root nodes] default=5 arg 2: 0 == aa [Whether to render as ASCII art] default=0 1: [ 1 1 1 1 1 ] [ 0 0 0 0 0 ] 2: [ 1 1 1 2 ] [ 0 0 0 0 ] 3: [ 1 1 2 1 ] [ 0 0 0 0 ] 4: [ 1 1 2 1 ] [ 0 0 0 1 ] 5: [ 1 1 3 ] [ 0 0 0 ] 6: [ 1 2 1 1 ] [ 0 0 0 0 ] 7: [ 1 2 1 1 ] [ 0 0 1 0 ] 8: [ 1 2 1 1 ] [ 0 0 1 1 ] 9: [ 1 2 2 ] [ 0 0 0 ] 10: [ 1 2 2 ] [ 0 0 1 ] 11: [ 1 3 1 ] [ 0 0 0 ] 12: [ 1 3 1 ] [ 0 0 1 ] 13: [ 1 3 1 ] [ 0 0 2 ] 14: [ 1 4 ] [ 0 0 ] 15: [ 2 1 1 1 ] [ 0 0 0 0 ] 16: [ 2 1 1 1 ] [ 0 1 0 0 ] 17: [ 2 1 1 1 ] [ 0 1 1 0 ] 18: [ 2 1 1 1 ] [ 0 1 1 1 ] 19: [ 2 1 2 ] [ 0 0 0 ] 20: [ 2 1 2 ] [ 0 1 0 ] 21: [ 2 1 2 ] [ 0 1 1 ] 22: [ 2 2 1 ] [ 0 0 0 ] 23: [ 2 2 1 ] [ 0 0 1 ] 24: [ 2 2 1 ] [ 0 1 0 ] 25: [ 2 2 1 ] [ 0 1 1 ] 26: [ 2 2 1 ] [ 0 1 2 ] 27: [ 2 3 ] [ 0 0 ] 28: [ 2 3 ] [ 0 1 ] 29: [ 3 1 1 ] [ 0 0 0 ] 30: [ 3 1 1 ] [ 0 1 0 ] 31: [ 3 1 1 ] [ 0 1 1 ] 32: [ 3 1 1 ] [ 0 2 0 ] 33: [ 3 1 1 ] [ 0 2 1 ] 34: [ 3 1 1 ] [ 0 2 2 ] 35: [ 3 2 ] [ 0 0 ] 36: [ 3 2 ] [ 0 1 ] 37: [ 3 2 ] [ 0 2 ] 38: [ 4 1 ] [ 0 0 ] 39: [ 4 1 ] [ 0 1 ] 40: [ 4 1 ] [ 0 2 ] 41: [ 4 1 ] [ 0 3 ] 42: [ 5 ] [ 0 ] ct=42