making a binary search tree database of a bunch of objects. How do I determine when the tree is actually full and I cannot add more leaves without the program crashing?