factor: trim using lists

[factor.git] / extra / rosetta-code / tree-traversal / tree-traversal.factor

diff --git a/extra/rosetta-code/tree-traversal/tree-traversal.factor b/extra/rosetta-code/tree-traversal/tree-traversal.factor
index 1a0ad9f449ee62e9e97bf9c8ad38c912f56efbd4..cb507ab672aed8050b16f7f28daa8e8d2b243b1b 100644 (file)
--- a/extra/rosetta-code/tree-traversal/tree-traversal.factor
+++ b/extra/rosetta-code/tree-traversal/tree-traversal.factor
@@ -1,6 +1,6 @@
 ! Copyright (c) 2012 Anonymous
 ! See http://factorcode.org/license.txt for BSD license.
-USING: accessors combinators deques dlists fry io kernel
+USING: accessors combinators deques dlists io kernel
 math.parser ;
 IN: rosetta-code.tree-traversal
 
@@ -71,7 +71,7 @@ CONSTANT: example-tree
             [ [ data>> ] dip call drop ]
             [ drop left>> [ swap push-back ] [ drop ] if* ]
             [ drop right>> [ swap push-back ] [ drop ] if* ]
-            [ nip (levelorder) ] 
+            [ nip (levelorder) ]
         } 3cleave
     ] if ; inline recursive
 
@@ -88,7 +88,7 @@ CONSTANT: example-tree
     ] while drop ; inline
 
 : tree-traversal-main ( -- )
-    example-tree [ number>string write " " write ] {
+    example-tree [ number>string write bl ] {
         [ "preorder:    " write preorder    nl ]
         [ "inorder:     " write inorder     nl ]
         [ "postorder:   " write postorder   nl ]