Binary Search Tree


   I have an NT 4.0 system running IB 4.2. I am using a table as a
binary search tree and I am trying to traverse the tree in the most
efficient manner using recursion (cs101). Should I circumvent the BDE
entirely and use C/C++, or can I use Delphi's TTable methods for the
best performance? I seems to me that the notion of a BST as a DB table
introduces dependencies for each row that prohibit efficient SQL command

table BST:

node(key)        parent       left_child       right_child

Please respond by email.

thank you,

matt harding