Tricky pointer basics explained | Iterative implementation of binary search

binary_search_iterative.cpp

tree_node* binary_search(tree_node* n, int value)
{
    if (n == NULL)
    {
        return NULL;
    }
    
    tree_node* x = n;

    while (x != NULL)
    {
        if (value == x->data)
        {
            return x;
        }

        if (value < x->data)
        {
            x = x->left;
        }
        else
        {
            x = x->right;
        }
    }

    return NULL;    // value was not found
}