This wizard will guide you through the process of examining an implementation of Michael Bender and Martin Farach-Coltons LCA algorithm. The implementation is written in perl by Zack Ramjan. This wizard does not explain the workings of the program. If that's what you are looking for, then check out the library file, an example driver, and function descriptions.

You will be going through the following steps:

• Step 1: Creating an Input Tree.
• Step 2: Provide some node pairs to perform queries on.
• Step 3: Preprocess the data, and view the answers to Step 2
• Step 4: Viewing a summery of the results

Proceed to Step 1, "Creating the Tree"