"Return a successor function t h a t generates a binary tree with n nodes."

#'(lambda (x)

(remove-if #'(lambda (child) (> child n))

(binary-tree x) 1))

> (depth-first-search 1 ( i s 12) (finite-binary-tree 15))

;; Search: (1)

;; Search: (2 3)

;; Search: (4 5 3)

;; Search: (8 9 5 3)

;; Search: (9 5 3)

;; Search: (5 3)

;: Search: (10 11 3)

;; Search: (11 3)

;; Search: (3)

;; Search: (6 7)

;; Search: (12 13 7)

12 Guiding the Search