Hi All,
I have been trying out the binary tree tutorial on this site. I ahve
got it working but i have a few questions/observations. Here is the thing:
1. I added 10000 elements using a for loop and used the loop
counter as key value. I got a stack overflow at 9960 each time.
2. I adden 1000000 elements using the rand function. This
work perfectly.
3. I went out on a limb and added 4000000 elements also
using the rand function. The program never finished.
I am wondering what one can expect out of binary trees and
if there are notible different ways in implementing them. I know
there is in linked list. e.g is 4000000 elements to much? or should they be able to handle that. And has any one got any tips or suggenstions on how to implement and use them.
G'n'R