down the tree

This piece of code was made when i helped a friend of mine in his university class on datastructures.
It's a very simple imlementation of binary-trees in scheme. The task was the following:
given tow lists holding the nodes from an inorder and and a preorder traversal of an unknown
tree, the code shall be able to construct this unknown tree from the lists given.

That's what (from-in-pre-order) does.
Additionally the code provides a generic procedure (traverse-tree) that is to be passed a tree
and a procedure implementing the order of traversal. There is pre,post and inorder predefined
as such a procedure.

That's all there is to it. I bet the code can be improved, feel free to do so :)

You need a working scheme-interpreter

Please login to post comments.

Cinjection

Posted 123 Days Ago

Ah. I see. Thanks.

closure

Posted 123 Days Ago

Hi cinjection, srfi-1 is the first of the scheme requests for implementions. Those are basically libraries. This particular library provides list-procedures. See: http://srfi.schemers.org/

Cinjection

Posted 123 Days Ago

Good stuff. I made something similar in Scheme as well. What is (use srfi-1)? I've seen it all you Scheme code.

Webcopper

Posted 198 Days Ago

wow... I can't understand it.... it's... totally unfamiliar... looks cool though :)

Page 1 of 1

Solving the N-Queens-Problem Part I
Recursive Lambdas with the Y and U Combinator
down the tree
simple constraint problem solver

Splitting a list recursively in Scheme
Genetic Algorithm for solving the N-Queens problem
Converting from infix notation to prefix and postfix notation
Factoring numbers
Path Finding

Genetic Algorithm for solving the N-Queens problem
Splitting a list recursively in Scheme
down the tree
Solving the N-Queens-Problem Part I
Factoring numbers