Recursive breadth first tree traversal
- by dugogota
I'm pulling my hair out trying to figure out how to implement breadth first tree traversal in scheme. I've done it in Java and C++. If I had code, I'd post it but I'm not sure how exactly to begin.
Given the tree definition below, how to implement breadth first search using recursion?
(define tree1 '( A ( B (C () ()) (D () ()) ) (E (F () ()) (G () ())) ))
Any help, any, is greatly appreciated.