Binary Search Tree Node Class (database engine)

Binary Search Tree Nodes Class - an effective and very fast searching/database storage methodology. This is a self-contained binary tree class along with a non-gui listbox class to create, search and maintain any unique key data in a binary tree. A lot of databases use this methodology as the basis for their database engines. Now you can have the database power inside your application. For example, a search of 3,000 keys will only require an average of 7-11 tree visits/seeks regardless of the key your are trying to locate. Also included are member routines to output all the data keys in tree in alpha order or even in reverse alpha order. This has been extensively tested for reliabilty and fast response for searching, insertions, deletions and traversals of tree nodes in general. Included root node release, tree re-balancing and garbage threshold detection and collection. Also extensive notes and a built-in commented example project/form to build a couple of example binary trees which output to a gui listbox. Also to demonstrate some of the class member functions usage. You may be surprised to learn there is little emphasis on recursion so no worries of runaway stack levels.(**IMPORTANT**: this latest version includes a major bug fix. When using the data index to reference external data, during a tree rebalance the data index was being lost or mixed up with another. It is a simple fix but significant to keeping the database integrity. This latest version is 1.1 and also includes the functions referenced in the supplemental article). ## LATEST: ## now includes a CD,DVD,Books Media Library application sample. ## (c) David K Richmond