Answer to Question #42264 in C++ for sarah

Question

write a program using BST to represent sets that implements following set operations. your program should take inputs from two text file set1 and set2 which contains comma separated list of integers.

void read( Char* filename); // read input from files Set1 and set2

int withinRange (int,int); //return the total numbers (Count) from the range which exist in the BST

void operator == (const Set <T>&); // S1==S2 check two sets are equal or not

set<T> operator + (const Set <T>&) // S1+S2 find the union of two sets

set<T> operator ^ (const Set <T>&) // S1^S2 find the intersection of two sets

set<T> operator - (const Set <T>&) // S1-S2 find the difference of two sets

Node<T>*after(int key); // find successor

Node<T>*before(int key); // find predecessor



plz help me in making this assignment i am so confused in it