功能性地穿过树

Question

我正在尝试编写自己的“遍历树”函数，但我是 FP 的新手

我写了这些函数，效果很好，但是看起来很丑

(defrecord Tree [value left right])
(defn depth_walk_tree
    [tree functor]
        (let [item (functor (:value tree))]
            (let [leftlst 
                    (if (:left tree) 
                        (cons item (depth_walk_tree (:left tree) functor)) 
                        (list item))
                 ]
                    (if (:right tree)
                        (concat 
                            leftlst 
                            (depth_walk_tree (:right tree) functor)) 
                        leftlst))))

(def tree (Tree. 1 (Tree. 2 (Tree. 0 nil nil) (Tree. 90 nil nil)) (Tree. 3 nil (Tree. 10 nil nil)) ))
    (println (depth_walk_tree tree #(+ % 1) ))

程序答案是

(2 3 1 91 4 11); is Ok

谁能告诉我如何让它变美？

PS 很抱歉我的写作错误。英语不是我的母语。

Answer 1

这看起来更实用，恕我直言：

(defn depth_walk_tree [tree functor]
  (concat
    (list (functor (:value tree)))
    (if (:left  tree) (depth_walk_tree (:left  tree) functor))
    (if (:right tree) (depth_walk_tree (:right tree) functor))))

它也保留了原始结果：

(depth_walk_tree tree inc)
=> (2 3 1 91 4 11)