Tricky pointer basics explained | Recursive implementation of binary search

binary_search_recursive.cpp

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

    if (value == n->data)
    {
        return n;
    }

    if (value < n->data)
    {
        return binary_search(n->left, value);
    }
    
    // else ...
    return binary_search(n->right, value);
}