This is the code for a full implementation of a binary search tree. It has find, insert and delete methods; all implemented on O(h), where h is the height of the tree.
This code is just for your amusement and to see how someone else implements a binary search tree.
If you are currently implementing a binary search tree for a computer science course (Like this code was used for), don't just copy and paste my code. In truth, the algorithms are not that complex that you coudn't figure them out on your own. Also, you are trusting that this code works. It may not, so use at your own risk.
© Jose Sandoval 2004-2009 firstname.lastname@example.org