0

Im trying to add Total function and isMono functions to this code. Did total already

Need help with function ismono which returns whether a tree is mono (all the elements are unique aka no element appears more than one time) or not. Please

this is the original program

```
#ifndef T_H
#define T_H
#include <iostream>
#include <iomanip>
using namespace std;
struct tnode {
int info ;
int count;
tnode * right, *left;
};
tnode * insert(int target,tnode * t);
tnode * makenode(int x);
tnode * tsearch(int x,tnode * t);
void inorder(tnode * t);
int height(tnode * t);
int count(tnode * t) ;
int total(tnode * t) ;
#endif
int main() {
int n,c;
tnode * t = NULL, *x;
while (cin >> n) {t=insert(n,t);cout << n <<' ';}
cout << endl;
inorder(t);
cout << endl;
c = count(t);
cout << "count: "<< c <<endl;
cout << endl;
c = height(t);
cout << "height: "<< c <<endl;
cout << endl;
c=200;
while (c-->0) if (x = tsearch(c,t)) cout << c << " is on the tree."<<endl;
return 0;
}
#include "t.h"
int count(tnode * t) {
if (t == NULL) return 0;
return 1 + count(t->left) + count (t->right);
}
#include "t.h"
int height(tnode * t) {
if (t == NULL) return -1;
return 1 + max(height(t->left) , height (t->right));
}
#include "t.h"
//write out t in order
void inorder(tnode * t) {
if (t == NULL) return;
inorder (t->left);//write out lst in order
cout <<setw(5) << t->info <<setw(5) << t->count<< endl;
inorder (t->right);//write out rst in order
}
#include "t.h"
tnode * insert(int x, tnode * t) {
tnode * tmp = tsearch(x,t);
if (tmp != NULL) {
tmp->count++;
return t;
}
if (t == NULL) return makenode(x);
if ( x < t->info ) {
t->left = insert(x,t->left);
return t;
}
t->right = insert(x,t->right);
return t;
}
#include "t.h"
tnode * makenode(int x) {
tnode * t = new tnode;
t->info =x;
t->count =1;
t->right = t->left = NULL;
return t;
}
```