Question

I am trying to create a function in c++ that checks if a binary search tree has duplicate values. It should be very simple and not call any outside values like "data".

please use this as a starting point:

template<typename X>

bool tree_duplicate(tree_node<X>* root) {

//code here

return true;

}

I don't need anything else created other then a basic function to tell if the tree has duplicates, and if it doesnt return FALSE.

if it helps I have a struct created:

struct tree_node {

X val;

Tree_node* left;

Tree_node* right;

Tree_node(X v) : val(v), left(NULL), right(NULL){}

}

Please do not use any outside variables. Everything needed to test/run the code is created so dont worry about that just create the basic check function.

Answer 1

template<typename X>
bool tree_duplicate(tree_node<X> *root) {
    if (root == NULL) {
        return false;
    } else {
        return tree_duplicate(root->left)
               || tree_duplicate(root->right)
               || (root->left != NULL && root->val == root->left->val)
               || (root->right != NULL && root->val == root->right->val);
    }
}