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?
Printable View
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?
I dunno, I guess it depends which library you are using.
If doing your own, it's when the new operator returns a null pointer.