Question

How do I implement overload operator == C++

No late submission Submission instructions: Name your file as (Last NameFirst Name.cpp). Up- load to Blackboard. 1. (Total 100 Points) Write a C++ program that implements a binary search tree (BST) to manage a number of integer items with different priorities. In order to do so, you will need to maintain a queue as an item in the tree. Each queue item is an integer. All items in a given queue will have the same priority. As a new item with a user-specified priority comes in, it should be enqueued in the queue with items of that priority. A new queue may need to created in case a queue with that priority does not exist. Use dynamic memory to manage nodes in the queue and BST. Absolutely no global variables anywhere in your code! Implement the following: (a) Constructor (b) Destructor (c) Overloaded copy constructor (d) Overloaded assignment operator. (e) Overloaded == operator to check if two trees are equal. A tree ti is equal to t2 if for every queue in tl, a corresponding queue with the same priority exists in t2 with the same set of elements the order of the elements in the queue does not matter). (1) Overloaded "<<" operator to show the contents of the tree. (8) Insert an item of specific priority. (h) Check for existence of an item of specific priority, (1) Remove an item of specific priority. 6) Clear all items of a specific priority, Use const keyword wherever appropriate. When referring to multiple trees, give a name to each tree as it is created by the user. Write a modular main program that is, with functions) to demonstrate all the features

Answer 1

THE FUNCTION WILL START FROM THE ROOT NODE AND WILL TRAVERSE THE WHOLE NODE ON THE BASE OF THEIR PRIIORITY IF THE PRIORITY AND THE VALUE MATCHES THEN IT WILL RETURN TRUE

bool BST::operator==(BinarySearchTree t2,BinarySearchTree t1) {
if(t1.root == NULL && t2.root == NULL) //Both are empty BST
   return true;
else{
   return isEqual(t2.root, t1.root); // comparing recursively
}
}

ANOTHER IMPLEMENTATION:

bool BST::operator==(BinarySearchTree t2,BinarySearchTree t1) {
if(t1.root==NULL && t2.root==NULL){
retrurn false;
}
int var=0;
bool flag=false;
else{
while(t1!=NULL){ // assuming both have equal lengths
if(queueT1.top()==queueT2.top()){ // check their top most element
flag=true; // if same set flag to true;
}
else{
flag=false; // if same set flag to false
}
queueT1.pop();
queueT2.pop();
}
break;
return true;
}
}

IF YOU HAVE ANY QUERY PLEASE COMMENT DOWN BELOW

PLEASE GIVE A THUMBS UP