| Topic 1: |
Binary Trees and So Much More!
Rick Dermont, RomtrenD Systems
http://ourworld.compuserve.com/homepages/rdermont
If you have used the Pascal files of record, you will appreciate their
speed and how little they add to the size of an executable and that there
is no DBE to distribute. The downside is the difficulty of getting your
data in the order you want it. I will present an indexes unit that adds
indexing capability to any file of record. For excellent performance the
indexes are implemented using sorted red-black binary trees. I will present
the classes in my unit and give a brief overview of binary trees. On the
way we will encounter two design patterns, the visitor pattern and the
iterator pattern.
|