(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. (g) Insert an item of specific priority. (h) Check for existence of an item of specific priority. (i) Remove an item of specific priority. (i) 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. Show transcribed image text (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. (g) Insert an item of specific priority. (h) Check for existence of an item of specific priority. (i) Remove an item of specific priority. (i) 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.
Expert Answer
Answer to (Total 100 Points) Write a C++ program that implements a binary search tree (BST) to manage a number of integer items wi…