Multiply two numbers represented by Linked Lists

#include
#include
using namespace std;

// Linked list node
struct Node
{
    int val;
    struct Node* next;
};

// Function for creating a new node with given value
struct Node *create_node(int val)
{
    struct Node *node_new = (struct Node *)
malloc(sizeof(struct Node));

// putting the data into the new node.
    node_new->val = val;
    // initially new node points to NULL
    node_new->next = NULL;

    return node_new;
}

// Function for inserting a node
// at the start of the Linked List
void push(struct Node** head_ref, int new_val)
{
    // assigning the node
    struct Node* node_new = create_node(new_val);

    // Now, link old list off the new node
    node_new->next = (*head_ref);

    // moving the head inorder to point to the new node
    (*head_ref) = node_new;
}

// to multiply data present in the two linked lists
long long multiplication (Node* list_one, Node* list_two)
{
    long long n= 1000000007;
    long long first_num = 0, second_num = 0;
    while (list_one || list_two){
        
        if(list_one){
            first_num = ((first_num)*10)%n + list_one->val;
            list_one = list_one->next;
        }
        
        if(list_two)
        {
            second_num = ((second_num)*10)%n + list_two->val;
            list_two = list_two->next;
        }
        
    }
    return ((first_num%n)*(second_num%n))%n;
}

// For printing the linked list
void display_list(struct Node *node)
{
    while(node != NULL)
    {
        cout<val;
        if(node->next)
            cout<<"->";
        node = node->next;
    }
}

// Driver function
int main()
{
    struct Node* one = NULL;
    struct Node* two = NULL;

    // creating list one 5->6->1
    push(&one, 1);
    push(&one, 6);
    push(&one, 5);
    printf("List one is: ");
    display_list(one);
    
    cout<<”\n”;

    // creating list two 4->2
    push(&two, 2);
    push(&two, 4);
    printf("List two is: ");
    display_list(two);
    
    cout<<”\n”;

    // Results after multiplying the two numbers.
    cout<<”Answer: “<

						 

class Multiply
{
    static class Node
    {
        int data;
        Node next;
        
        Node(int data){
            this.data = data;
            next = null;
        }
    }
    // Multiply contents of two linked lists
    static long multiplyTwoLists(Node first, Node second)
    {
        long N = 1000000007;
        long num1 = 0, num2 = 0;

        while (first != null || second != null){
            
            if(first != null){
                num1 = ((num1)*10)%N + first.data;
                first = first.next;
            }
            
            if(second != null)
            {
                num2 = ((num2)*10)%N + second.data;
                second = second.next;
            }
            
        }
        return ((num1%N)*(num2%N))%N;
    }
    static void printList(Node node)
    {
        while(node != null)
        {
            System.out.print(node.data);
            if(node.next != null)
                System.out.print("->");
            node = node.next;
        }
        System.out.println();
    }

    // Driver program to test above function
    public static void main(String args[])
    {
        // create first list 9->4->6
        Node first = new Node(9);
        first.next = new Node(4);
        first.next.next = new Node(6);
        System.out.print("First List is: ");
        printList(first);

        // create second list 8->4
        Node second = new Node(8);
        second.next = new Node(4);
        System.out.print("Second List is: ");
        printList(second);

        // Multiply the two lists and see result
        System.out.print("Result is: ");
        System.out.println(multiplyTwoLists(first, second));
    }
}

class Node:
    
    def __init__(self, data):
        
        self.data = data
        self.next = None
    
class LinkedList:

    def __init__(self):

        self.head = None

    # Function to insert a node at the
    # beginning of the Linked List
    def push(self, new_data):
    
        # Create a new Node
        new_node = Node(new_data)

        # Make next of the new Node as head
        new_node.next = self.head

        # Move the head to point to new Node
        self.head = new_node
        
    # Function to print the Linked List
    def printList(self):
        
        ptr = self.head

        while (ptr != None):
            print(ptr.data, end = '')
            if ptr.next != None:
                print('->', end = '')
                
            ptr = ptr.next
            
        print()

# Multiply contents of two Linked Lists
def multiplyTwoLists(first, second):

    num1 = 0
    num2 = 0

    first_ptr = first.head
    second_ptr = second.head
    
    while first_ptr != None or second_ptr != None:
        if first_ptr != None:
            num1 = (num1 * 10) + first_ptr.data
            first_ptr = first_ptr.next
    
        if second_ptr != None:
            num2 = (num2 * 10) + second_ptr.data
            second_ptr = second_ptr.next
    
    return num1 * num2

# Driver code
if __name__=='__main__':

    first = LinkedList()
    second = LinkedList()

    first.push(1)
    first.push(6)
    first.push(5)

    print("First list is: ", end = '')
    first.printList()

    second.push(2)
    second.push(4)

    print("Second List is: ", end = '')
    second.printList()

    result = multiplyTwoLists(first, second)
    print("Result is: ", result)