Breadth-First Tree Search
Searching siblings before sublists
(define search
(lambda (x l)
(cond ((null? l) NIL)
((atom? (car l))
(or (eq? x (car l)) (search x (cdr l))))
(else (or (search x (cdr l))
(search x (car l)))))))
Previous slide
Next slide
Back to first slide
View graphic version