Binary Search Tree
====================

Usage
-----
This program implements a binary search tree for TI-Basic programmers. A sample program using it is provided for reference. To setup the BST, store 0 to theta and call prgmBST.
To test for a value in the tree, store 1337.1337 to theta, and the number to find to I and call prgmBST. It will return either 1 or 0 in ans depending on whether was found.
To get the contents of the tree returned as a sorted list in Ans, store 0 to A and 42.1337 to theta. To insert a value into the tree, store 42.1337 to theta, and the number to insert to I.
Please note that due to the restrictions of TI-Basic this particular BST may only hold 98 entries, containing real numbers.
This program is (C)2006 by Thomas Dickerson under the GNU General Public License. A copy should have been included with this download in the file gpl.txt. If it wasn't, please contact the FSF for your free copy of the GPL.


Contact Information:
--------------------
Author Profile: http://www.ticalc.org/archives/files/authors/90/9089.html
Email: elfprince13@gmail.com
Website: http://rancidmoose.unitedti.org