#include "../crush/BinaryTree.h" using namespace crush; #include #include using namespace std; int main() { BinaryTree t; vector nodes; for (int i=0; i<30; i++) { cout << "adding " << i << endl; int n = t.add_node(1); nodes.push_back(n); //cout << t << endl; } cout << t << endl; for (int k=0; k<10000; k++) { if (rand() % 2) { cout << "adding" << endl; nodes.push_back( t.add_node(1) ); } else { if (!nodes.empty()) { //for (int i=0; i