Question

Write a recursive function (C++) that searches a binary tree that is NOT ordered like a BST. In other words, there is no ordering relationship among the parent, child or sibling node values.

Use the following prototype and data structure:

struct node {
    node *left;
    node *right;
    int val;
};

// First parameter:  pointer to a node
// Second parameter:  the value to find
bool searchValue(node *, int);

The function searchValue() should return true if the integer value in the tree, false otherwise. The first call to searchValue() should pass a pointer to the root of the tree.

No main() is required, only your implementation of searchValue.

Answer 1

struct node {
    node *left;
    node *right;
    int val;
};

// First parameter:  pointer to a node
// Second parameter:  the value to find
bool searchValue(node *n, int num) {
    if (n == nullptr) {
        return false;
    } else {
        if (num == n->val) {
            return true;
        } else {
            return searchValue(n->left, num) || searchValue(n->right, num);
        }
    }
}