Compute this in C++ using class BST, class Queues, and class Nodes. 1. (Total 10

Question

Compute this in C++ using class BST, class Queues, and class Nodes. 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 treetl 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 Overloaded operator to show the contents of the tree. (g) Insert an item of specific priority. (h) heck for existence of an item of specific priority. i) Remove an item of specific priority. G) 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.

Explanation / Answer

Hii there,

Check this code .This may help you out.

code

#include <iostream>

}

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.