Display program code

dfsearch.pl : Depth first search in tree
Depth first search for value in binary tree.

How to use:
V is a value, T, L, R are trees. A tree has one of two forms:
node(V,L,R) or leaf(V)
A depth first search for value V in tree T is invoked by dfsearch(T, V).

Program: Change the code, then submit!

Console: Enter query or select example from below, then submit and wait for answer!

Select example query: 

CHR
WebCHR help - CHR Website - (c) Copyrights Martin Kaeser Uni Ulm 2007