Sublist Search (Search a linked list in another list)

#include 
using namespace std;
 
//  Linked List node structure
struct Node
{
    int data;
    Node* next;
};
 
//This searchList function will return true if list1 is present in list2
bool searchList(Node* list1, Node* list2)
{
    Node* p1 = list1, *p2 = list2;
 
    if (list1 == NULL && list2 == NULL)
        return true;
 
    if ( list1 == NULL || (list1 != NULL && list2 == NULL))
        return false;
 
    while (list2 != NULL)
    {
        p2 = list2;
 
        while (p1 != NULL)
        {
            if (p2 == NULL)
                return false;
 
            
            else if (p1->data == p2->data)
            {
                p1 = p1->next;
                p2 = p2->next;
            }
            else break;
        }
 
        if (p1 == NULL)
            return true;
 
        p1 = list1;
 
        list2 = list2->next;
    }
 
    return false;
}
 
/* This function is used to print the nodes of a given linked list */
void printList(Node* node)
{
    while (node != NULL)
    {
        printf("%d ", node->data);
        node = node->next;
    }
}
 
// This function is used to add a new node to a linked list
Node *newNode(int key)
{
    Node *temp = new Node;
    temp-> data= key;
    temp->next = NULL;
    return temp;
}
 
int main()
{
    Node *list1 = newNode(1);
    list1->next = newNode(2);
    list1->next->next = newNode(4);
 
    Node *list2 = newNode(1);
    list2->next = newNode(2);
    list2->next->next = newNode(1);
    list2->next->next->next = newNode(2);
    list2->next->next->next->next = newNode(4);
    list2->next->next->next->next->next = newNode(3);
 
    searchList(list1,list2) ? cout << "Found" :
                    cout << "Not Found";
 
    return 0;
}

class SublistSearch
{
    static class Node
    {
	    int data;
	    Node next;
    };
    // Returns true if first list is present in second list
    static boolean findList(Node first,Node second)
    {
	    Node ptr1 = first, ptr2 = second;

	    // If both linked lists are empty,return true
	    if (first == null && second == null)
		    return true;

	    // Else If one is empty and
	    // other is not, return false
	    if (first == null ||
	    (first != null && second == null))
		    return false;

	    // Traverse the second list by picking nodes one by one
	    while (second != null)
	    {
		    // Initialize ptr2 with
		    // current node of second
		    ptr2 = second;

		    // Start matching first list
		    // with second list
		    while (ptr1 != null)
		    {
			    // If second list becomes empty and
			    // first not then return false
			    if (ptr2 == null)
				    return false;

			    // If data part is same, go to next of both lists
			    else if (ptr1.data == ptr2.data)
			    {
				    ptr1 = ptr1.next;
				    ptr2 = ptr2.next;
			    }
			    // If not equal then break the loop
			    else break;
		    }
		    // Return true if first list gets traversed
		    // completely that means it is matched.
		    if (ptr1 == null)
			    return true;

		    // Initialize ptr1 with first again
		    ptr1 = first;

		    // And go to next node of second list
		    second = second.next;
	    }
	    return false;
    }
    static void printList(Node node)
    {
	    while (node != null)
	    {
		    System.out.printf("%d ", node.data);
		    node = node.next;
	    }
    }
    static Node newNode(int key)
    {
	    Node temp = new Node();
	    temp.data= key;
	    temp.next = null;
	    return temp;
    }
    // Driver Code
    public static void main(String[] args)
    {
	    Node a = newNode(1);
	    a.next = newNode(2);
	    a.next.next = newNode(3);
	    a.next.next.next = newNode(4);

	    Node b = newNode(1);
	    b.next = newNode(2);
	    b.next.next = newNode(1);
	    b.next.next.next = newNode(2);
	    b.next.next.next.next = newNode(3);

	    if(findList(a, b) == true)
		    System.out.println("LIST FOUND");
	    else
		    System.out.println("LIST NOT FOUND");
    }
}

class Node:
    def __init__(self, value = 0):
        
        self.value = value
        self.next = None

# Returns true if first list is
# present in second list
def findList(first, second):
    
    if not first and not second:
        return True

    if not first or not second:
        return False

    ptr1 = first
    ptr2 = second

    while ptr2:

        ptr2 = second
        while ptr1:

            if not ptr2:
                return False
            elif ptr1.value == ptr2.value:
                ptr1 = ptr1.next
                ptr2 = ptr2.next

            else:
                break

        if not ptr1:
            return True

        ptr1 = first
        second = second.next
        
    return False

node_a = Node(1)
node_a.next = Node(2)
node_a.next.next = Node(4)

node_b = Node(1)
node_b.next = Node(2)
node_b.next.next = Node(1)
node_b.next.next.next = Node(2)
node_b.next.next.next.next = Node(4)
node_b.next.next.next.next.next = Node(3)

if findList(node_a, node_b):
    print("LIST FOUND")
else:
    print("LIST NOT FOUND")