C++

#include using namespace std; 11 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; EEEE //===== 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 x X if (temp -> left == NULL) cout left -> X x right == NULL) cout right -> x left); display(temp -> right); > //. bool isEmpty if (root == NULL) return true; return false; ) public: //... void renoveAll(int value) { while (true) Node. temp = root, ptemp = root; while (temp != NULL &s temp -> 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 != 1 if (temp as root) root = temp -> right; else if (ptemp -> left a 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 != ! Node. tempHolder = temp, ptempHolder = temp; while (tempHolder -> left != NULL) { ptempHolder = tempHolder: tempHolder = tempHolder -> left; ) temp -> x = tempHolder -> X; ptempHolder -> left = tempHolder -> right; temp = tempHolder; > delete temp; cout void renove(int value) Node temp = root,ptemp = root; while (temp != NULL && temp -> * != 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