im having a difficulty with adding a node to a binary tree can any one help? her

Question

im having a difficulty with adding a node to a binary tree can any one help? here is my .h file look like #include #include //using namespace std; class treeFilter { struct Node { Node* right; int m_data; Node* left; }; Node* head; void removeAll(); public: //treeFilter(); //~treeFilter(){removeAll();} //Node* search(int); void insertNumber(int); //void insert(Node*&,Node*); void deleteNode(int); void deleteTree(){removeAll();} } here is my .cpp file look like #include "primeFilter.h" void treeFilter::insertNumber(int data) { if(head != NULL) { Node* temp = head; Node* insertN = new Node; insertN->m_data = data; insertN->left = NULL; insertN->right = NULL; while(temp != NULL) { if(head->m_data < insertN->m_data) { // go to left temp->left = insertN; temp = temp->left; temp->m_data = data; //insertNumber(insertN->m_data); temp->right = NULL; temp->left = NULL; } else { temp->right = insertN; temp = temp->right; //insertNumber(insertN->m_data); temp->right = NULL; temp->left = NULL; } } } else { head = new Node; head->m_data = data; head->right = NULL; head->left = NULL; } } here is my main looks like #include "primeFilter.h" #include using namespace std; int main() { treeFilter myNode; myNode.insertNumber(5); return 0; }

Explanation / Answer

//pls rate //your .h file class treeFilter { public: struct Node { Node* right; int m_data; Node* left; }; Node* head; void removeAll(); treeFilter(); ~treeFilter(); Node* search(int); void insertNumber(int); void insert(Node*&,Node*); void deleteNode(int); void deleteTree(); }; void treeFilter::insertNumber(int data) { if(head != NULL) { Node* temp = head; Node* insertN = new Node; insertN->m_data = data; insertN->left = NULL; insertN->right = NULL; while(temp != NULL) { if(head->m_data m_data) { temp->left = insertN; temp = temp->left; temp->m_data = data; insertNumber(insertN->m_data); temp->right = NULL; temp->left = NULL; } else { temp->right = insertN; temp = temp->right; insertNumber(insertN->m_data); temp->right = NULL; temp->left = NULL; } } } else { head = new Node; head->m_data = data; head->right = NULL; head->left = NULL; } } treeFilter::treeFilter() { head=NULL; } treeFilter::~treeFilter() { removeAll(); } void treeFilter::deleteTree() { removeAll(); } void treeFilter::removeAll() { delete head; head=NULL; } //your main file #include #include "primeFilter.h" using namespace std; int main() { treeFilter myNode; myNode.insertNumber(5); }

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

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