3 #include "../crush/BinaryTree.h"
16 for (int i=0; i<30; i++) {
17 cout << "adding " << i << endl;
18 int n = t.add_node(1);
24 for (int k=0; k<10000; k++) {
26 cout << "adding" << endl;
27 nodes.push_back( t.add_node(1) );
30 //for (int i=0; i<nodes.size(); i++) {
31 int p = rand() % nodes.size();
34 cout << "removing " << n << endl;
37 for (int j=p; j<nodes.size(); j++)
38 nodes[j] = nodes[j+1];