Merge point of Linked Lists

Create a merge point of two linked lists and print the merge point of linked lists.

Author: Rahitya5

Merge point of Linked Lists

@@ -0,0 +1,50 @@
+class Node: #node creation
+    def __init__(self,data):
+        self.data=data
+        self.next=None
+class Llist: #main logic for list
+    def __init__(self):
+        self.head=None
+    def build(self,data):
+        new_node=Node(data) #calling Node class for creation of new_node
+        if self.head is None:
+            self.head=new_node
+        else:
+            temp=self.head
+            while temp.next is not None:
+                temp=temp.next
+            temp.next=new_node
+    #MERGE POINT/INTERSECTION POINT OF LINKED LIST 
+    def get_intersection_node(self,other_list):
+        a,b=self.head,other_list.head
+        while a!=b:
+            a=other_list.head if not a else a.next
+            #a is none and a.next is none assign to opposite list head
+            b=self.head if not b else b.next
+            #b is none and a.next is none assign to opposite list head
+        return a
+    def display(self):
+        temp=self.head
+        while temp is not None:
+            print(temp.data,end="->")
+            temp=temp.next
+        print("None")
+l1=Llist()
+l1.build(1)
+l1.build(2)
+merge_node=Node(3)
+l1.head.next.next=merge_node
+l1.build(4)
+l1.build(5)
+l2=Llist()
+l2.head=merge_node
+l2.build(6)
+l2.build(7)
+l2.build(8)
+print("List 1:")
+l1.display()
+print("List 2:")
+l2.display()
+#find and print the merge Point 
+merge_point=l1.get_intersection_node(l2)
+print("Merge Point:",merge_point.data if merge_point else "No merge point")