If you are building a binary tree for searching, try a hash instead. It may have a lower multiplier for your data.
-Mark
In reply to Re: Possible Memory Usage Issues
by kvale
in thread Possible Memory Usage Issues
by abitkin
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |