algorithms/src/binary_search_tree_demo.cpp at master · FindMeCoder/algorithms

Repository navigation

#include <stdio.h>

#include <generic.h>

#include <time.h>

#include "shuffle.h"

#include "binary_search_tree.h"

using namespace alg;

int main()

{

const int MAX_ELEMENTS = 10;

int key[MAX_ELEMENTS];

int value[MAX_ELEMENTS];

BST<int, int> t;

int i = 0;

srand(time(NULL));

// generate random numbers and fill them to the list

for(i = 0; i < MAX_ELEMENTS; i++ ){

key[i] = rand()%100;

value[i] = rand()%1000;

}

for(i = 0; i < MAX_ELEMENTS; i++){

printf("insert %d->%d\n",key[i], value[i]);

t.insert(key[i], value[i]);

}

t.print_helper();

for(i = 0; i < MAX_ELEMENTS; i++){

printf("getting %d->%d\n",key[i], t.find(key[i])->value);

}

for(i = 0; i < MAX_ELEMENTS; i++){

t.deleteKey(key[i]);

t.print_helper();

printf("deleted %d\n\n", key[i]);

}

return 0;

}