I need help changing this code below. My friends have the samecode and I need the code to look different.
It should still run the same and have the same output just thechange up the code a little bit.
The code is just bascially a binarrySaerchtree with values init.
–
#include <iostream>
#include <ctime>
using namespace std;
class tree
{
struct node
{
int data;
node *left;
node *right;
};
node *root;
node *makeEmpty(node *t)
{
if (t == NULL)
return NULL;
{
makeEmpty(t->left);
makeEmpty(t->right);
delete t;
}
return NULL;
}
node *insert(int x, node *t)
{
if (t == NULL)
{
t = new node;
t->data = x;
t->left = t->right = NULL;
}
else if (x < t->data)
t->left = insert(x, t->left);
else if (x > t->data)
t->right = insert(x, t->right);
return t;
}
node *findMin(node *t)
{
if (t ==
PayPal Gateway not configured
PayPal Gateway not configured