Path Finding

The function find allows the user to create a path to a node in the tree. The path is given as a list in the form: (start second third ... endpoint). That is to get to endpoint, you have to go from start to second to third, all of which represent nodes in the tree. If the target is not in the tree, the function returns and empty list.

Output:
(a c i n)

Please login to post comments.

Page 1 of 1

Genetic Algorithm for solving the N-Queens problem
Converting from infix notation to prefix and postfix notation
Factoring numbers
Path Finding
Pre, in, post order traversal of a binary tree.

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

Splitting a list recursively in Scheme
down the tree
Solving the N-Queens-Problem Part I
Factoring numbers
Filtered Accumulator