Question

The following code is from a C++ file.

What I'm wondering/looking for is if there's another way to insert numbers 1-100 in a random order. I don't think you should need the code for BinarySearchTree.h, but if you do, copy and paste the link below into your browser for it.

https://justpaste.it/30xml

/*
 * Create another integer Binary Search Tree. Insert the numbers from 1 to 100 in a random order.
 * Then search for all 100 numbers in the tree and record their depths in a file.
 */
BinarySearchTree<int> BinarySearchTree2;
shuffle(begin(numbers), end(numbers), default_random_engine(chrono::system_clock::now().time_since_epoch().count()));
for(int i = 0; i < 100; ++i)
    BinarySearchTree2.add(numbers[i]);

Answer 1

#include<bits/stdc++.h>
using namespace std;
int main(){
BinarySearchTree<int> BinarySearchTree2;
set<int> s; //declare a set
srand(time(0)); //set seed as time
int num;
for(int i = 0; i < 100; ++i){
    do {
        num = (rand()%100) + 1; //generate random number
    }while(s.find(num) != s.end()); //checks for whether number is already generated
    BinarySearchTree2.add(num);
}
    return 0;
}