Create a class Solution here you get)) code:: #include #include #include #includ

Question

Create a class

Explanation / Answer

here you get)) code:: #include #include #include #include #include #include using namespace std; class box { private: int v; public: box() { v=0; } box(int value) { v=value; } int show() { return v; } }; struct node { int key_value; int key_freq; node *left; node *right; }; class btree { public: btree(); ~btree(); void insert(int key, int freq); node *search(int key); void destroy_tree(); void depth_first(); private: void destroy_tree(node *leaf); void insert(int key, int freq, node *leaf); node *search(int key, node *leaf); void depth_first(node*b); node *root; }; btree::btree() { root=NULL; } void btree::destroy_tree(node *leaf) { if(leaf!=NULL) { destroy_tree(leaf->left); destroy_tree(leaf->right); delete leaf; } } void btree::insert(int key, int freq, node *leaf) { if(keykey_value) { if(leaf->left!=NULL) insert(key, freq, leaf->left); else { leaf->left=new node; leaf->left->key_value=key; leaf->left->key_freq=freq; leaf->left->left=NULL; //Sets the left child of the child node to null leaf->left->right=NULL; //Sets the right child of the child node to null } } else if(key>=leaf->key_value) { if(leaf->right!=NULL) insert(key, freq, leaf->right); else { leaf->right=new node; leaf->right->key_value=key; leaf->right->key_freq=freq; leaf->right->left=NULL; //Sets the left child of the child node to null leaf->right->right=NULL; //Sets the right child of the child node to null } } } node *btree::search(int key, node *leaf) { if(leaf!=NULL) { if(key==leaf->key_value) return leaf; if(keykey_value) return search(key, leaf->left); else return search(key, leaf->right); } else return NULL; } void btree::insert(int key,int freq) { if(root!=NULL) insert(key, freq, root); else { root=new node; root->key_value=key; root->key_freq=freq; root->left=NULL; root->right=NULL; } } node *btree::search(int key) { return search(key, root); } void btree::destroy_tree() { destroy_tree(root); } btree::~btree() { destroy_tree(); } void btree::depth_first() { depth_first(root); } void btree::depth_first(node* root) { if(root) { cout

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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