Files
CSCI-1200/lectures/19_trees_II/ds_set_main.cpp
2025-03-26 13:01:41 -04:00

32 lines
855 B
C++

#include <iostream>
#include "ds_set.h"
int main() {
// create a set of integers
ds_set<int> numbers;
// insert some values into the set
numbers.insert(10);
numbers.insert(5);
numbers.insert(20);
numbers.insert(15);
numbers.insert(5); // Duplicate value (won't be inserted)
// print the elements of the set
std::cout << "The elements in the set are:" << std::endl;
for(ds_set<int>::iterator itr = numbers.begin(); itr != numbers.end(); ++itr){
std::cout << *itr << " ";
}
std::cout << std::endl;
// check if a specific value exists in the set
int value = 15;
if (numbers.find(value) != numbers.end()) {
std::cout << value << " is found in the set." << std::endl;
} else {
std::cout << value << " is not found in the set." << std::endl;
}
return 0;
}