Thread: ABt Binary Search Trees

use an array

Code:

int random_integer[15]
	for(int index=0; index<14; index++) {
		random_integer[i] = (rand()%100)+1;
		cout << random_integer[i] << endl;
	}
	for(int index=14; index>0; index--) {// check through in reverse order
		cout << random_integer[i] << endl;
	}

they are the only ways you can transverse through the list(?), though you can point to a specific array element by using random_interger[5] or whatever number element you want to look at.

also this isn't a binary search tree that you are asking for, however you have written "this will be the input for your search tree" so I assume that you already have a separate search tree?. http://en.wikipedia.org/wiki/Binary_search_tree