Design Pattern: Binary Tree Recursion

If we are using the form of binary tree that has contents, left and right, we can alter the design pattern slightly:

(defun myfun (tree)
         (if (not (null tree))
         (combine (contents tree)
                         (myfun (left tree))
                         (myfun (right tree)))
                 (nullanswer tree) ))

Contents    Page-10    Prev    Next    Page+10    Index