 : stretch-tree ( max-depth -- )
     1 + 0 over bottom-up-tree item-check
     [ "stretch tree of depth " write pprint ]
-    [ "\t check: " write . ] bi* ;
+    [ "\t check: " write . ] bi* ; inline
 
 :: long-lived-tree ( max-depth -- )
     0 max-depth bottom-up-tree

        [ >r 2 *     r> bottom-up-tree ] 2tri
    ] [
        drop f f
    ] if <tree-node> ;

GENERIC: item-check ( node -- n )


    ] each

    "long lived tree of depth " write max-depth pprint
    "\t check: " write item-check . ; inline

: binary-trees ( n -- )
    min-depth 2 + max [ stretch-tree ] [ long-lived-tree ] bi ; inline

: binary-trees-main ( -- )
    16 binary-trees ;
