Create Circular Linked List C++

C++/Data Structure/Linked List/Circular Linked List C++

@@ -0,0 +1,94 @@
+#include <iostream>
+using namespace std;
+
+class Node{
+public:
+    int data;
+    Node* next;
+};
+
+class CircularLinkedList{
+private:
+    Node* head;
+public:
+    CircularLinkedList(int A[], int n);
+    void Display();
+    void recursiveDisplay(Node* p);
+    Node* getHead(){ return head; }
+    ~CircularLinkedList();
+
+
+};
+
+CircularLinkedList::CircularLinkedList(int *A, int n) {
+
+    Node* t;
+    Node* tail;
+
+    head = new Node;
+
+    head->data = A[0];
+    head->next = head;
+    tail = head;
+
+    for (int i=1; i<n; i++){
+        t = new Node;
+        t->data = A[i];
+        t->next = tail->next;
+        tail->next = t;
+        tail = t;
+    }
+}
+
+void CircularLinkedList::Display() {
+    Node* p = head;
+    do {
+        cout << p->data << " -> " << flush;
+        p = p->next;
+    } while (p != head);
+    cout << endl;
+}
+
+void CircularLinkedList::recursiveDisplay(Node *p) {
+    static int flag = 0;
+    if (p != head || flag == 0){
+        flag = 1;
+        cout << p->data << " -> " << flush;
+        recursiveDisplay(p->next);
+    }
+    flag = 0;
+}
+
+CircularLinkedList::~CircularLinkedList() {
+    Node* p = head;
+    while (p->next != head){
+        p = p->next;
+    }
+
+    while (p != head){
+        p->next = head->next;
+        delete head;
+        head = p->next;
+    }
+
+    if (p == head){
+        delete head;
+        head = nullptr;
+    }
+
+}
+
+
+int main() {
+
+    int A[] = {1, 3, 5, 7, 9};
+
+    CircularLinkedList cl(A, sizeof(A)/sizeof(A[0]));
+
+    cl.Display();
+
+    Node* h = cl.getHead();
+    cl.recursiveDisplay(h);
+
+    return 0;
+}