Create Find intersection point of 2 Linked Lists

Find intersection point of 2 Linked Lists

@@ -0,0 +1,99 @@
+#include <iostream>
+#include <cmath>
+#include <stack>
+
+using namespace std;
+
+class Node{
+public:
+    int data;
+    Node* next;
+};
+
+Node* head = new Node;
+Node* second = new Node;
+
+void create(int A[], int n){
+    Node* temp;
+    Node* tail;
+
+    head->data = A[0];
+    head->next = nullptr;
+    tail = head;
+
+    for (int i=1; i<n; i++){
+        temp = new Node;
+        temp->data = A[i];
+        temp->next = nullptr;
+        tail->next = temp;
+        tail = temp;
+    }
+}
+
+void createSecond(int A[], int n, Node* p){
+    Node* temp;
+    Node* tail;
+
+    second->data = A[0];
+    second->next = nullptr;
+    tail = second;
+
+    for (int i=1; i<n; i++){
+        temp = new Node;
+        temp->data = A[i];
+        temp->next = nullptr;
+        tail->next = temp;
+        tail = temp;
+    }
+    tail->next = p;
+}
+
+void Intersection(Node* p, Node* q){
+    // Populate first stack
+    stack<Node*> stk1;
+    while (p != nullptr){
+        stk1.push(p);
+        p = p->next;
+    }
+
+    // Populate second stack
+    stack<Node*> stk2;
+    while (q != nullptr){
+        stk2.push(q);
+        q = q->next;
+    }
+
+    Node* r;
+    while (stk1.top() == stk2.top()){
+        r = stk1.top();
+        stk1.pop();
+        stk2.pop();
+    }
+    cout << "Intersecting Node: " << r->data << endl;
+}
+
+
+int main() {
+
+    // Create First Linked List
+    int A[] = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21};
+    create(A, sizeof(A)/sizeof(A[0]));
+
+    // Create Second Linked List
+    Node* temp = head;
+    int i = 5;
+    while (i>0){
+        temp = temp->next;
+        i--;
+    }
+    cout << temp->data << endl;
+
+    int B[] = {2, 4, 6, 8, 10};
+    createSecond(B, sizeof(B)/sizeof(B[0]), temp);
+
+    // Find Intersection
+    Intersection(head, second);
+
+
+    return 0;
+}