Search found 1 match
- Mon Sep 20, 2010 10:41 am
- Forum: The Lounge
- Topic: Tree Traverse
- Replies: 1
- Views: 8684
Tree Traverse
Hi , I'm new in LISP.I saw the solution for Binary tree traverse , but I don't understand "FUN" in this problem . Could you please help me ?! :oops: (defstruct (btnode) (val nil) (left nil) (right nil)) ;; naive traversal functions (defun traverse-pre-order (node fun) (if node (progn (appl...