Question: C++ #include using namespace std; // struct Node { int x; Node.left; Node. right; Node(){left = NULL; right = NULL;) Node(int d, Node 1 =

1; right = r; }; //==== class Tree { private: Node '

root; public: Tree) { root = NULL; } void insert(int x) Node.

ptr = new Node(x); cout * > *) { if (temp ->

left == NULL) { cout X left = ptr; break; } else

C++

#include using namespace std; // struct Node { int x; Node.left; Node. right; Node(){left = NULL; right = NULL;) Node(int d, Node 1 = 0, Node* r =) { x = d; left = 1; right = r; }; //==== class Tree { private: Node ' root; public: Tree) { root = NULL; } void insert(int x) Node. ptr = new Node(x); cout * > *) { if (temp -> left == NULL) { cout X left = ptr; break; } else temp = temp -> left; } else { if (temp -> right == NULL) cout x right = ptr; break; else temp = temp -> right; cout left); cout x right); 11. public void preorder(){ inorder (root); } private void preorder (Node. temp) { if (temp != NULL) { cout x left); preorder (temp -> right); > ) public void postorder({ inorder (root); } private: void postorder (Nodetemp) { if (temp = NULL) { postorder(temp -> left); postorder (temp -> right); cout X "" } public void serial serial(root); } private void serial(Node *n) { cout left); cout right); { cout left == NULL && temp -> right == NULL) { if (temp == root) root = NULL; else if (ptemp -> left == temp) ptemp -> left = NULL; else if (ptemp right = temp) } else if (temp -> left == NULL & temp -> right != 1 if (temp =- root) root = temp -> right; else if (ptemp -> left us temp) ptemp -> left temp => right; else if (ptemp -> right us temp) ptemp -> right = temp -> left; else if (temp -> Fight == NULL & temp -> left != 1 if (temp =- root) root = temp -> left; else if (ptemp -> left temp) ptemp -> left = temp -> left; else if (ptemp -> right = temp) ptemp -> right = temp -> right; } else if (temp -> left = NULL && temp -> right = 1 Node. tempHolder = temp. ptepholder = temp; while (tempHolder -> left != NULL) ptempHolder = tempHolder; tempHolder = tempHolder -> left; ) temp -> x = tempHolder -> x; ptempHolder -> left = tempHolder -> right; } temp = tempHolder: delete temp: cout X = value) { ptemp = temp: if (temp -> X right; else if (temp -> X > value) temp = temp -> left; } if (temp == NULL) { cout left == NULL && temp -> right == NULL) if (temp = root) root = NULL; else if (ptemp => left == temp) ptemp -> left = NULL; else if (ptemp -> right == temp) ptemp -> right = NULL; else if (temp-> left == NULL && temp -> right != NULL if (tempa root) root = temp -> right; else if (ptemp => left = temp) ptemp -> left = temp -> right; else if (ptemp -> right = temp) ptemp -> right = temp -> left; } else if (temp -> right == NULL && temp -> left != NULL if (temps root) root = temp -> left; else if (ptemp -> left = temp) ptemp -> left = temp -> left; else if (ptemp -> right temp) ptemp -> right = temp -> right; else if (temp -> left != NULL && temp -> right 1= NULL Node.tempHolder = temp,ptempHolder = temp: while (tempHolder -> left != NULL) { ptempHolder = temp Holder; tempHolder = tempHolder -> left; ) temp -> X = tempHolder -> x; ptemp Holder -> left = tempHolder -> right; temp = tempHolder ) delete temp; cout left): deleteAllNodes (temp -> right); cout X

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

C++ #include using namespace std; struct Node { int data; Node* next; Node(){ data = 0; next = NULL; } Node(int x){ data = x; next = NULL; } }; struct LinkedList { Node* head; LinkedList(){ head =...

Data Structure in C++ #include using namespace std; struct node { int key; node* left; node* right; node* parent; }; In this assignment youre going to implement splay trees. BST Implementation For...

trying to get my program to run and print a link list backwards. i know this is only part fo the ptogram chegg only lets you put so much. please halp me print the link list backwards. C++ #include...

#include using namespace std; //===================================================================== struct Node { int x; Node * left; Node * right; Node(){left = NULL; right = NULL;} Node(int d,...

Add methods to the Tree class of BST_Basic-004cpp.cpp to do the following: 1) find1, an iterative version of find that takes an int parameter and looks for it in the tree. Return NULL if not found,...

Add methods to the Tree class to do the following: 1) find1, an iterative version of find that takes an int parameter and looks for it in the tree. Return NULL if not found, or a pointer to the Node...

Hi, Is there a possibility where you can change this code so user can input information through the console? Such as: Mike - 100, Tom - 75, Steve - 99, Carry - 58, Stephanie - 82, George - 42 Like...

please i need an explanation for this code like a report // C++ program to sort link list // using insertion sort #include using namespace std; struct Node { int val; struct Node* next; Node(int x) {...

please i need report for this code / C++ program to sort link list // using insertion sort #include using namespace std; struct Node { int val; struct Node* next; Node(int x) { val = x; next = NULL;...

data structure (c++) 2 Binary Tree A binary tree is a data structure where all node has at most two children. Excercise: Given the code of the Node struct and the insert method of the tree, implement...

Assume a single taxpayer is taxed at 10% on the first $9,525 of taxable income, 12% on the next $29,175 of income, and at 22% for the following $43,800 of income. What is the tax liability for a...

How should Windows Wear handle the various challenges before it?

This is the premium added as a compensation for the risk that an investor will not get paid in full. It changes over time, depending on the expected rate of return on productive assets exchanged...

Seved Help 14 Wisconsin Snowmobile Corp. is considering a switch to level production Cost efficiencies would occur under level production, and aftertax costs would decline by $31,500, but inventory...

In an Excel Pivot Table, how is a Fact/Measure Column repeated?

In Gender Pay Equity Studies in the Federal Service, how can comparisons be ensured across Job of Comparable Worth?

In the Federal Evaluation System (FES), what standards are used in the Job Evaluation Process?