The graph theory site by Christopher Mawata, University of Tennessee at Chattanooga, http://www.utc.edu/~cpmawata/petersen/ also contains information about trees. Professor Mawata also wrote a software package called Petersen that is available for downloading at http://www.utc.edu/~cpmawata/petersen/download.htm. Documentation about the package is at http://www.utc.edu/~cpmawata/petersen/intro.htm.

A Huffman code demonstration is at http://ciips.ee.uwa.edu.au/~morris/Year2/PLDS210/huffman.html.

See my own site treedef.pdf.

See http://www.utc.edu/~cpmawata/petersen/lesson20.htm.

An animation of breadth-first search is available at http://www.cs.duke.edu/csed/jawaa/BFSanim.html.

An animation of depth-first search is available at http://www.cs.duke.edu/csed/jawaa/DFSanim.html.

An animation of the 8-queens problem is at http://www.math.utah.edu/~alfeld/queens/queens.html. My own source code is nqueens.c.

See http://www.utc.edu/~cpmawata/petersen/lesson23.htm and http://www.cs.sunysb.edu/~algorith/files/minimum-spanning-tree.shtml.

An animation of Prim’s Algorithm is at http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/index.html. My own source code for Prim’s Algorithm is prim.c.

Animations of Kruskal’s Algorithm are at http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/index.html and http://students.ceid.upatras.gr/~papagel/project/kruskal.htm.

See http://www.hpmuseum.org/rpn.htm and http://www.hpmuseum.org/rpnvers.htm.

My source code for determining whether two binary trees are isomorphic is bin_tree.c.

See http://www.csee.umbc.edu/417/current/notes/games/.

The Chinook checker program site is http://web.cs.ualberta.ca/~chinook.