Find the distinct elements common to all rows of a matrix

// C Program 
// Find the distinct elements common to all rows of a matrix
#include <stdio.h>
#include <malloc.h>
//Size of Matrix
#define R 5
#define C 9

// Linked List node
struct Node
{
    int data;
    struct Node *next;
};

// Define LinkedList  
struct LinkedList
{
    struct Node *head;
};

// Create a new node of linked list
struct Node *new_node(int data)
{
    // Create dynamic node of Node
    struct Node *node = (struct Node *) malloc(sizeof(struct Node));
    if (node == NULL)
    {
        printf("\nMemory Overflow, when creating a new Node\n");
    }
    else
    {
        node->data = data;
        node->next = NULL;
    }
    return node;
}
// Create a new linked list
struct LinkedList *linked_list()
{
    // Create dynamic list of LinkedList
    struct LinkedList *new_list = (struct LinkedList *) malloc(sizeof(struct LinkedList));
    if (new_list == NULL)
    {
        printf("\nMemory Overflow, when creating a new LinkedList\n");
    }
    else
    {
        new_list->head = NULL;
    }
    return new_list;
}
// Add nodes in linked list
void add_node(struct LinkedList *list_node, int data)
{
    if (list_node->head == NULL)
    {
        list_node->head = new_node(data);
    }
    else
    {
        struct Node *temp = list_node->head;
        //Find last node position
        while (temp->next != NULL)
        {
            if (temp->data == data || temp->next->data == data)
            {
                //Node already exists
                return;
            }
            temp = temp->next;
        }
        //Add node at last position
        temp->next = new_node(data);
    }
}
//Check element exists in given row
int find_element(int matrix[R][C], int row, int element)
{
    for (int i = 0; i < C; ++i)
    {
        if (matrix[row][i] == element)
        {
            return 1;
        }
    }
    return 0;
}
// Display result
void node_result(struct LinkedList *list_node)
{
    struct Node *temp = list_node->head;

    printf(" Distinct row elements is : ");

    if (temp == NULL)
    {
        printf(" None \n");
    }
    else
    {
        // Display resultant linked list nodes
        while (temp != NULL)
        {
            printf("  %d", temp->data);
            //Visit to next node
            temp = temp->next;
        }
        printf("\n");
    }
}
// Collect and display the distinct elements of matrix by row wise
void distinct_elements(int matrix[R][C])
{
    // Create a empty linked list
    struct LinkedList *list_node = linked_list();

    // Loop controlling variable
    int i = 0;

    //Add first row into linked list
    for (i = 0; i < C; ++i)
    {
        add_node(list_node, matrix[0][i]);
    }

    
    //Define some useful Node variables
    struct Node *auxiliary = list_node->head;
    struct Node *temp = NULL;
    struct Node *back = NULL;
    //starting row
    i = 1;

    while (auxiliary != NULL && i < R)
    {
        temp = auxiliary;

        // Reset values
        auxiliary = NULL;
        back = NULL;

        // Check and remove linked list node which is not in matrix row
        while (temp != NULL)
        {
            //check that whether linked list node element exists in i-th row of matrix
            if (find_element(matrix, i, temp->data) == 0)
            {
                // When the elements are not exists
                // delete linked list node
                if (back == NULL)
                {
                    // Deleting first node of this linked list
                    list_node->head = temp->next;
                    // get remove node
                    auxiliary = temp;
                    // change current node
                    temp = list_node->head;
                }
                else
                {
                    //When an intermediate node is removed
                    auxiliary = temp;
                    temp = temp->next;
                    back->next = temp;
                }
                // Remove node
                free(auxiliary);
                auxiliary = NULL;
            }
            else
            {
                back = temp;
                // Visit to next node
                temp = temp->next;
            }
        }
        //Start to first node of linked list
        auxiliary = list_node->head;
        // next row
        i++;
    }
    // This is print similar elements in each row of given matrix
    node_result(list_node);
}
int main()
{
    // Define matrix of integer elements
    int matrix[R][C] = {
        {
            1 , 6 , 0 , 5 , 2 , 9 , 3 , 5 , 4
        } , 
        {
            17 , 0 , 9 , 3 , 4 , 1 , 5 , 2 , 4
        } , 
        {
            0 , 5 , 3 , 1 , 6 , 8 , 2 , 1 , 4
        } , 
        {
            1 , 5 , 8 , 9 , 2 , 4 , 0 , 2 , 3
        } , 
        {
            1 , 7 , 8 , 6 , 1 , 5 , 0 , 3 , 3
        } , 
    };

    distinct_elements(matrix);

    return 0;
}

Output

 Distinct row elements is :   1  0  5  3