Project Description

Status of Project

Quotable Quotes

Algorithm 1:

• Produces a binary tree ignoring node sizes

Algorithm 2:

• Produces a B-tree that is sensitive to block effects and block transfers
• Proven (by other people) to be the optimal algorithm

As of right now, I have programmed the following:

• Given three files with n inputs each (one for keys, one for costs, one for probabilities), a binary tree is made using Algorithm 1, given to me. In-order and Post-order traversals of the tree are printed to screen and are outputted to files.
• Given a binary tree, the average cost to its leaves is computed.
• Given the In-order and Pre-order traversal input files, the original binary tree is recreated. In-order and Post-order traversals are printed only to screen, just to check that it produces the same output as when the tree was originally created.