today_19.ipynb

{
 "cells": [
  {
   "cell_type": "code",
   "execution_count": 22,
   "metadata": {},
   "outputs": [],
   "source": [
    "class Singly_Creation_Node(object):\n",
    "\n",
    "    def __init__(self,elements):\n",
    "        self.elements = elements\n",
    "        self.next = None\n",
    "\n",
    "\n",
    "class Singly_Linked_List(object):\n",
    "\n",
    "    def __init__(self):\n",
    "        self.Head = None\n",
    "\n",
    "\n",
    "    def Insertion_at_front(self,ele):\n",
    "        ptr = Singly_Creation_Node(ele)\n",
    "        if (self.Head == None):\n",
    "            self.Head = ptr\n",
    "            return\n",
    "        else:\n",
    "            ptr.next = self.Head\n",
    "            self.Head = ptr\n",
    "\n",
    "    def Insertion_at_specific(self,pos,ele):\n",
    "        ptr = Singly_Creation_Node(ele)\n",
    "        if (pos < 1) :\n",
    "            print(\"position is greater than >= 1\")\n",
    "        elif (pos == 1 and self.Head == None):\n",
    "            self.Head = ptr\n",
    "            ptr.next = self.Head\n",
    "            return\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            for i in range(pos-1):\n",
    "                if (temp.next != None):\n",
    "                    temp = temp.next\n",
    "            if (temp != None):\n",
    "                ptr.next = temp.next\n",
    "                temp.next = ptr\n",
    "                \n",
    "    def Insertion_at_rear(self,ele):\n",
    "        ptr = Singly_Creation_Node(ele)\n",
    "        if (self.Head == None):\n",
    "            self.Head = ptr\n",
    "            ptr.next = self.Head\n",
    "            return\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next != None):\n",
    "                temp = temp.next\n",
    "            temp.next = ptr\n",
    "\n",
    "    def Search_Node(self,search):\n",
    "        temp = self.Head\n",
    "        found = 0\n",
    "        i = 0\n",
    "        if (temp != None):\n",
    "            while (temp != None):\n",
    "                i +=1\n",
    "                if (temp.elements == search):\n",
    "                    found +=1\n",
    "                    break\n",
    "                temp = temp.next\n",
    "            if (found == 1):\n",
    "                print(found,'elements is found ',i)\n",
    "            else:\n",
    "                print(found , \"element is not found\" ,i )\n",
    "                \n",
    "    def Count_Node(self):\n",
    "        count = 0\n",
    "        temp = self.Head\n",
    "        while (temp != None):\n",
    "            count +=1\n",
    "            temp = temp.next\n",
    "        return count\n",
    "\n",
    "    def Deletion_at_front(self):\n",
    "        if (self.Head == None):\n",
    "            self.Head = None\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            self.Head = self.Head.next\n",
    "            temp = None\n",
    "\n",
    "    def Deletion_at_specific(self,pos):\n",
    "        if (pos < 1):\n",
    "            print(\"position is greater than >= 1\")\n",
    "        elif (pos == 1 and self.Head == None):\n",
    "            self.Head = None\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            for i in range(pos-1):\n",
    "                if (temp.next != None):\n",
    "                    temp = temp.next\n",
    "            if (temp != None):\n",
    "                Mid_node = temp.next\n",
    "                temp.next = temp.next.next\n",
    "                Mid_node = None\n",
    "\n",
    "    def Deletion_at_rear(self):\n",
    "        if (self.Head == None):\n",
    "            self.Head = None\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next.next != None):\n",
    "                temp = temp.next\n",
    "            end_node = temp.next\n",
    "            temp.next = temp.next.next\n",
    "            end_node = None\n",
    "\n",
    "    def Traverse(self):\n",
    "        temp = self.Head\n",
    "        while (temp != None):\n",
    "            print(temp.elements)\n",
    "            temp = temp.next\n",
    "            "
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 27,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "1 elements is found  5\n",
      "6\n"
     ]
    }
   ],
   "source": [
    "si = Singly_Linked_List()\n",
    "si.Insertion_at_front(18)\n",
    "si.Insertion_at_front(108)\n",
    "si.Insertion_at_specific(1,63)\n",
    "si.Insertion_at_specific(1,45)\n",
    "si.Insertion_at_rear(54)\n",
    "si.Insertion_at_rear(100)\n",
    "si.Search_Node(54)\n",
    "print(si.Count_Node())\n",
    "si.Deletion_at_front()\n",
    "si.Deletion_at_front()\n",
    "si.Deletion_at_specific(1)\n",
    "si.Deletion_at_specific(1)\n",
    "si.Deletion_at_rear()\n",
    "# si.Deletion_at_rear()\n",
    "si.Deletion_at_front()\n",
    "si.Traverse()"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 57,
   "metadata": {},
   "outputs": [],
   "source": [
    "class Circular_Creation_Node(object):\n",
    "\n",
    "    def __init__(self,elements):\n",
    "        self.elements = elements\n",
    "        self.next = None\n",
    "\n",
    "class Circular_Linked_List(object):\n",
    "\n",
    "    def __init__(self):\n",
    "        self.Head = None\n",
    "\n",
    "    def Insertion_at_front(self,ele):\n",
    "        ptr = Circular_Creation_Node(ele)\n",
    "        if (self.Head == None):\n",
    "            self.Head = ptr\n",
    "            ptr.next = self.Head\n",
    "            return\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next != self.Head):\n",
    "                temp = temp.next\n",
    "            temp.next = ptr\n",
    "            ptr.next = self.Head\n",
    "            self.Head = ptr\n",
    "\n",
    "    def Insertion_at_specific(self,pos,ele):\n",
    "        ptr = Circular_Creation_Node(ele)\n",
    "        if (pos < 1):\n",
    "            print(\"position is greater than >= 1\")\n",
    "        elif (pos == 1 and self.Head == None):\n",
    "            self.Head = ptr\n",
    "            ptr.next = self.Head\n",
    "            self.Head = ptr\n",
    "            return\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            for i in range(pos-1):\n",
    "                if (temp.next != self.Head):\n",
    "                    temp = temp.next\n",
    "            if (temp != None):\n",
    "                ptr.next = temp.next\n",
    "                temp.next = ptr\n",
    "\n",
    "    def Insertion_at_rear(self,ele):\n",
    "        ptr = Singly_Creation_Node(ele)\n",
    "        if (self.Head == None):\n",
    "            self.Head = ptr\n",
    "            ptr.next = self.Head\n",
    "            self.Head = ptr\n",
    "            return\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next != self.Head):\n",
    "                temp = temp.next\n",
    "            temp.next = ptr\n",
    "            ptr.next = self.Head\n",
    "\n",
    "    def Search_Node(self,Search):\n",
    "        temp = self.Head\n",
    "        found = 0\n",
    "        i = 0\n",
    "        if (temp != None):\n",
    "            while (temp != None):\n",
    "                i +=1\n",
    "                if (temp.elements == Search):\n",
    "                    found +=1\n",
    "                    break\n",
    "                temp = temp.next\n",
    "            if (found == 1):\n",
    "                print(found , \"elements is found \" ,i)\n",
    "            else:\n",
    "                print(found , \"elements is not found \",i)\n",
    "    \n",
    "    def Count_Node(self):\n",
    "        count = 0\n",
    "        temp = self.Head\n",
    "        while (temp.next != self.Head):\n",
    "            temp = temp.next\n",
    "            count+=1\n",
    "        return count\n",
    "    \n",
    "    def Deletion_at_front(self):\n",
    "        if (self.Head == None):\n",
    "            self.Head = None\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next != self.Head):\n",
    "                temp = temp.next\n",
    "            first_node = temp.next\n",
    "            self.Head = self.Head.next\n",
    "            temp.next = self.Head\n",
    "            first_node = None\n",
    "\n",
    "    def Deletion_at_specific(self,pos):\n",
    "        if (pos < 1 ):\n",
    "            print(\"position is greater than >= 1\")\n",
    "        elif (pos == 1 and self.Head == None):\n",
    "            first_node = self.Head\n",
    "            self.Head = self.Head.next\n",
    "            first_node = None\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            for i in range(pos-1):\n",
    "                if (temp.next != self.Head):\n",
    "                    temp = temp.next\n",
    "            if (temp != None):\n",
    "                Mid_node = temp.next\n",
    "                temp.next = temp.next.next\n",
    "\n",
    "    def Deletion_at_rear(self):\n",
    "        if (self.Head == None):\n",
    "            self.Head = None\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next.next != self.Head):\n",
    "                temp = temp.next\n",
    "            end_node = temp.next\n",
    "            temp.next = self.Head\n",
    "            end_node = None\n",
    "            \n",
    "    def Traverse(self):\n",
    "        temp = self.Head\n",
    "        while (temp != None):\n",
    "            print(temp.elements)\n",
    "            temp = temp.next\n",
    "            if (temp == self.Head):\n",
    "                break\n"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 61,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "1 elements is found  3\n",
      "5\n",
      "23\n"
     ]
    }
   ],
   "source": [
    "di = Circular_Linked_List()\n",
    "di.Insertion_at_front(18)\n",
    "di.Insertion_at_front(108)\n",
    "di.Insertion_at_specific(1,23)\n",
    "di.Insertion_at_specific(1,54)\n",
    "di.Insertion_at_rear(100)\n",
    "di.Insertion_at_rear(101)\n",
    "di.Search_Node(23)\n",
    "print(di.Count_Node())\n",
    "di.Deletion_at_front()\n",
    "di.Deletion_at_front()\n",
    "di.Deletion_at_specific(1)\n",
    "di.Deletion_at_specific(2)\n",
    "di.Deletion_at_rear()\n",
    "di.Traverse()"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 101,
   "metadata": {},
   "outputs": [],
   "source": [
    "class Double_Creation_Node(object):\n",
    "\n",
    "    def __init__(self,elements):\n",
    "        self.elements = elements\n",
    "        self.next = None\n",
    "        self.prev = None\n",
    "\n",
    "class Doubly_Linked_List(object):\n",
    "\n",
    "    def __init__(self):\n",
    "        self.Head = None\n",
    "\n",
    "    def Insertion_at_front(self,ele):\n",
    "        ptr = Double_Creation_Node(ele)\n",
    "        if (self.Head == None):\n",
    "            self.Head = ptr\n",
    "            return\n",
    "        else:\n",
    "            ptr.next = self.Head\n",
    "            self.Head = ptr\n",
    "            ptr.prev = self.Head\n",
    "\n",
    "    def Insertion_at_specific(self,pos,ele):\n",
    "        ptr = Double_Creation_Node(ele)\n",
    "        if (pos < 1 ):\n",
    "            print(\"position is greater than >= 1\")\n",
    "        elif (pos == 1 and self.Head == None):\n",
    "            ptr.next = self.Head\n",
    "            self.Head = ptr\n",
    "            ptr.prev = self.Head\n",
    "            return\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            for i in range(pos-1):\n",
    "                if (temp.next != None):\n",
    "                    temp = temp.next\n",
    "            if (temp != None):\n",
    "                ptr.next = temp.next\n",
    "                temp.next = ptr\n",
    "                ptr.prev = self.Head\n",
    "                \n",
    "    def Insertion_at_rear(self,ele):\n",
    "        ptr = Double_Creation_Node(ele)\n",
    "        if (self.Head == None):\n",
    "            ptr.next = self.Head\n",
    "            self.Head = ptr\n",
    "            ptr.prev = self.Head\n",
    "            return\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next != None):\n",
    "                temp = temp.next\n",
    "            temp.next = ptr\n",
    "            ptr.prev = self.Head \n",
    "\n",
    "    def Search_Node(self,search):\n",
    "        temp = self.Head\n",
    "        found = 0\n",
    "        i = 0\n",
    "        if (temp != None):\n",
    "            while (temp != None):\n",
    "                i +=1\n",
    "                if (temp.elements == search):\n",
    "                    found +=1\n",
    "                    break\n",
    "                temp = temp.next\n",
    "            if (found == 1):\n",
    "                print(found , 'elment is found' ,i)\n",
    "            else:\n",
    "                print(found , \"element is not found\" ,i)\n",
    "\n",
    "    def Count_Node(self):\n",
    "        count = 0\n",
    "        temp = self.Head\n",
    "        while (temp != None):\n",
    "            count +=1\n",
    "            temp = temp.next\n",
    "        return count \n",
    "\n",
    "    def Deletion_at_front(self):\n",
    "        if (self.Head == None):\n",
    "            self.Head = None\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            self.Head = self.Head.next\n",
    "            temp.prev = None \n",
    "\n",
    "    def Deletion_at_specific(self,pos):\n",
    "        if (pos < 1):\n",
    "            print(\"position is greater than >= 1\")\n",
    "        elif (pos == 1 and self.Head == None):\n",
    "            first_node = self.Head\n",
    "            self.Head = self.Head.next\n",
    "            first_node.prev = None\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            for i in range(pos-1):\n",
    "                if (temp.next != None):\n",
    "                    temp = temp.next\n",
    "            if (temp != None):\n",
    "                mid_node = temp.next\n",
    "                temp.next = temp.next.next\n",
    "                mid_node.prev = None \n",
    "\n",
    "    def Deletion_at_rear(self):\n",
    "        if (self.Head == None):\n",
    "            first_node = self.Head\n",
    "            self.Head = self.Head.next\n",
    "            first_node = None\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next.next != None):\n",
    "                temp = temp.next\n",
    "            last_node = temp.next\n",
    "            temp.next = temp.next.next\n",
    "            last_node.prev = None  \n",
    "\n",
    "    def Traverse(self):\n",
    "        temp = self.Head\n",
    "        while (temp != None):\n",
    "            print(temp.elements)\n",
    "            temp = temp.next\n",
    "\n",
    "\n"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 104,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "1 elment is found 3\n",
      "6\n",
      "65\n"
     ]
    }
   ],
   "source": [
    "di = Doubly_Linked_List()\n",
    "di.Insertion_at_front(18)\n",
    "di.Insertion_at_front(36)\n",
    "di.Insertion_at_specific(1,54)\n",
    "di.Insertion_at_specific(2,65)\n",
    "di.Insertion_at_rear(100)\n",
    "di.Insertion_at_rear(101)\n",
    "di.Search_Node(65)\n",
    "print(di.Count_Node())\n",
    "di.Deletion_at_front()\n",
    "di.Deletion_at_front()\n",
    "di.Deletion_at_specific(1)\n",
    "# di.Deletion_at_specific(1)\n",
    "di.Deletion_at_rear()\n",
    "di.Deletion_at_rear()\n",
    "di.Traverse()"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 142,
   "metadata": {},
   "outputs": [],
   "source": [
    "class DC_Creation_Node(object):\n",
    "\n",
    "    def __init__(self,elements):\n",
    "        self.elements = elements\n",
    "        self.next = None\n",
    "        self.prev = None\n",
    "        \n",
    "class DC_Linked_List(object):\n",
    "\n",
    "    def __init__(self):\n",
    "        self.Head = None\n",
    "\n",
    "    def Insertion_at_front(self,ele):\n",
    "        ptr = DC_Creation_Node(ele)\n",
    "        if (self.Head == None):\n",
    "            self.Head = ptr\n",
    "            ptr.next = self.Head\n",
    "            ptr.prev = self.Head\n",
    "            return\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next != self.Head):\n",
    "                temp = temp.next\n",
    "            temp.next = ptr\n",
    "            ptr.next = self.Head\n",
    "            self.Head = ptr\n",
    "            ptr.prev = self.Head\n",
    "\n",
    "    def Insertion_at_specific(self,pos,ele):\n",
    "        ptr = DC_Creation_Node(ele)\n",
    "        if (pos < 1):\n",
    "            print(\"position is greater than >= 1\")\n",
    "        elif (pos == 1 and self.Head == None):\n",
    "            self.Head = ptr\n",
    "            ptr.next = self.Head\n",
    "            ptr.prev = self.Head\n",
    "            return\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            for i in range(pos-1):\n",
    "                if (temp.next != self.Head):\n",
    "                    temp = temp.next\n",
    "            if (temp != None):\n",
    "                ptr.next = temp.next\n",
    "                temp.next = ptr\n",
    "                ptr.prev = self.Head\n",
    "\n",
    "    def Insertion_at_rear(self,ele):\n",
    "        ptr = DC_Creation_Node(ele)\n",
    "        if (self.Head == None):\n",
    "            self.Head = ptr\n",
    "            ptr.next = self.Head\n",
    "            ptr.prev = self.Head\n",
    "            return\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next != self.Head):\n",
    "                temp = temp.next\n",
    "            temp.next = ptr\n",
    "            ptr.next = self.Head\n",
    "            self.Head.prev = ptr\n",
    "\n",
    "    def Search_Node(self,search):\n",
    "        temp = self.Head\n",
    "        found = 0\n",
    "        i = 0\n",
    "        if (temp != None):\n",
    "            while (temp != None):\n",
    "                i +=1\n",
    "                if (temp.elements == search):\n",
    "                    found +=1\n",
    "                    break\n",
    "                temp = temp.next\n",
    "            if (found == 1):\n",
    "                print(found , \"element is found \", i)\n",
    "            else:\n",
    "                print(found , \"element is not found \", i)\n",
    "                \n",
    "    def count_node(self):\n",
    "        temp = self.Head\n",
    "        count = 0\n",
    "        while (temp.next != self.Head):\n",
    "            count =+1\n",
    "            temp = temp.next\n",
    "        return count\n",
    "\n",
    "    def Deletion_at_front(self):\n",
    "        if (self.Head == None):\n",
    "            self.Head = None\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next != self.Head):\n",
    "                temp = temp.next\n",
    "            first_node = temp.next\n",
    "            self.Head = self.Head.next\n",
    "            temp.next = self.Head\n",
    "            first_node.prev = None\n",
    "\n",
    "    def Deletion_at_specific(self,pos):\n",
    "        if (pos < 1):\n",
    "            print(\"position is greater than >= 1\")\n",
    "        elif (pos == 1 and self.Head == None):\n",
    "            first = self.Head\n",
    "            self.Head = self.Head.next\n",
    "            first.prev = None\n",
    "            return\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            for i in range(pos-1):\n",
    "                if (temp.next != self.Head):\n",
    "                    temp = temp.next\n",
    "            if (temp != None):\n",
    "                mid_node = temp.next\n",
    "                temp.next = temp.next.next\n",
    "                mid_node.prev = None \n",
    "    def Deletion_at_rear(self):\n",
    "        if (self.Head == None):\n",
    "            first_node = self.Head\n",
    "            self.Head = self.Head.next\n",
    "            first_node.prev = self.Head\n",
    "            first_node = None\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next.next != self.Head):\n",
    "                temp = temp.next\n",
    "            end_node = temp.next\n",
    "            temp.next = self.Head\n",
    "            end_node.prev = None      \n",
    "        \n",
    "    def Traveerse(self):\n",
    "        temp = self.Head\n",
    "        while (temp != None):\n",
    "            print(temp.elements)\n",
    "            temp = temp.next\n",
    "            if (temp == self.Head):\n",
    "                break\n"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 146,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "1 element is found  3\n",
      "1\n",
      "54\n"
     ]
    }
   ],
   "source": [
    "dc = DC_Linked_List()\n",
    "dc.Insertion_at_front(18)\n",
    "dc.Insertion_at_front(25)\n",
    "dc.Insertion_at_specific(1,54)\n",
    "dc.Insertion_at_specific(1,68)\n",
    "dc.Insertion_at_rear(87)\n",
    "dc.Insertion_at_rear(88)\n",
    "dc.Search_Node(54)\n",
    "print(dc.count_node())\n",
    "dc.Deletion_at_front()\n",
    "dc.Deletion_at_front()\n",
    "dc.Deletion_at_specific(1)\n",
    "dc.Deletion_at_rear()\n",
    "dc.Deletion_at_rear()\n",
    "dc.Deletion_at_front()\n",
    "dc.Traveerse()"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 4,
   "metadata": {},
   "outputs": [],
   "source": [
    "class Normal_Queue(object):\n",
    "\n",
    "    def __init__(self,elments):\n",
    "        self.elements = elments\n",
    "        self.Queue = [None] * elments\n",
    "        self.front = -1\n",
    "        self.rear = -1\n",
    "\n",
    "    def Insertion_at_rear(self,ele):\n",
    "        if (self.rear + 1) == self.elements-1:\n",
    "            print(\"Queue is overflow\")\n",
    "        elif (self.front == -1 and self.rear == -1):\n",
    "            self.front = 0\n",
    "            self.rear = 0\n",
    "        else:\n",
    "            self.rear = (self.rear + 1)\n",
    "        add = self.Queue[self.rear] = ele\n",
    "        return add\n",
    "\n",
    "    def Deletion_at_front(self):\n",
    "        if (self.rear == -1 and self.rear == -1):\n",
    "            print(\"Queue is emtpy\")\n",
    "        elif (self.front == self.rear):\n",
    "            self.front = -1\n",
    "            self.rear = -1\n",
    "        else:\n",
    "            remove = self.Queue[self.front]\n",
    "            self.front = self.front + 1\n",
    "            return\n",
    "    \n",
    "    def Traverse(self):\n",
    "        if (self.rear == -1 and self.rear == -1):\n",
    "            print(\"Queue is empty \")\n",
    "        else:\n",
    "            while (self.front != self.rear):\n",
    "                print(self.Queue[self.front])\n",
    "                self.front = (self.front +1 ) % self.elements\n",
    "            print(self.Queue[self.rear])\n",
    "        "
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 11,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "81\n",
      "63\n"
     ]
    }
   ],
   "source": [
    "nq = Normal_Queue(9)\n",
    "nq.Insertion_at_rear(18)\n",
    "nq.Insertion_at_rear(45)\n",
    "nq.Insertion_at_rear(36)\n",
    "nq.Deletion_at_front()\n",
    "nq.Insertion_at_rear(108)\n",
    "nq.Insertion_at_rear(69)\n",
    "nq.Deletion_at_front()\n",
    "nq.Deletion_at_front()\n",
    "nq.Insertion_at_rear(81)\n",
    "nq.Insertion_at_rear(63)\n",
    "nq.Deletion_at_front()\n",
    "nq.Deletion_at_front()\n",
    "nq.Traverse()"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 48,
   "metadata": {},
   "outputs": [],
   "source": [
    "class new_creation_Node(object):\n",
    "    def __init__(self,elements):\n",
    "        self.elements = elements\n",
    "        self.next = None\n",
    "\n",
    "class new_Linked_List(object):\n",
    "    def __init__(self):\n",
    "        self.Head = None\n",
    "\n",
    "    def Insertion_at_rear(self,ele):\n",
    "        ptr = new_creation_Node(ele)\n",
    "        if (self.Head == None):\n",
    "            self.Head = ptr\n",
    "            ptr.next = self.Head\n",
    "            return\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next != self.Head):\n",
    "                temp = temp.next\n",
    "            temp.next = ptr\n",
    "            ptr.next = self.Head\n",
    "    \n",
    "    def Deletion_at_front(self):\n",
    "        if (self.Head == None):\n",
    "            self.Head = None\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next != self.Head):\n",
    "                temp = temp.next\n",
    "            first_node = None\n",
    "            self.Head = self.Head.next\n",
    "            temp.next = self.Head\n",
    "            first_node = None\n",
    "    \n",
    "    def Traverse(self):\n",
    "        temp = self.Head\n",
    "        while (temp != None):\n",
    "            print(temp.elements)\n",
    "            temp = temp.next\n",
    "            if (temp == self.Head):\n",
    "                break\n",
    "            \n",
    "            "
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 53,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "54\n"
     ]
    }
   ],
   "source": [
    "nn = new_Linked_List()\n",
    "nn.Insertion_at_rear(18)\n",
    "nn.Insertion_at_rear(45)\n",
    "nn.Deletion_at_front()\n",
    "nn.Insertion_at_rear(63)\n",
    "nn.Insertion_at_rear(54)\n",
    "nn.Deletion_at_front()\n",
    "nn.Deletion_at_front()\n",
    "nn.Traverse()"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 63,
   "metadata": {},
   "outputs": [],
   "source": [
    "class sikk_creation_node(object):\n",
    "    def __init__(self,elements):\n",
    "        self.elements = elements\n",
    "        self.next = None\n",
    "\n",
    "class sikk_Linked_List(object):\n",
    "    def __init__(self):\n",
    "        self.Head = None\n",
    "\n",
    "    def Insertion_at_rear(self,ele):\n",
    "        ptr = sikk_creation_node(ele)\n",
    "        if (self.Head == None):\n",
    "            ptr.next = self.Head\n",
    "            self.Head = ptr\n",
    "            return\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next != None):\n",
    "                temp = temp.next\n",
    "            temp.next = ptr\n",
    "\n",
    "    def Deletion_at_front(self):\n",
    "        if (self.Head == None):\n",
    "            self.Head = None\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            self.Head = self.Head.next\n",
    "            temp = None\n",
    "    \n",
    "    def Traverse(self):\n",
    "        temp = self.Head\n",
    "        while (temp != None):\n",
    "            print(temp.elements)\n",
    "            temp = temp.next\n"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 65,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "45\n"
     ]
    }
   ],
   "source": [
    "kk = sikk_Linked_List()\n",
    "kk.Insertion_at_rear(18)\n",
    "kk.Insertion_at_rear(35)\n",
    "kk.Insertion_at_rear(45)\n",
    "kk.Deletion_at_front()\n",
    "kk.Deletion_at_front()\n",
    "kk.Traverse()"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 75,
   "metadata": {},
   "outputs": [],
   "source": [
    "class DDouble_Creation_Node(object):\n",
    "    def __init__(self,elements):\n",
    "        self.elements = elements\n",
    "        self.next = None\n",
    "        self.prev = None\n",
    "\n",
    "class DDouble_Linked_List(object):\n",
    "    def __init__(self):\n",
    "        self.Head = None\n",
    "\n",
    "    def Insertion_at_rear(self,ele):\n",
    "        ptr = DDouble_Creation_Node(ele)\n",
    "        if (self.Head == None):\n",
    "            ptr.next = self.Head\n",
    "            self.Head = ptr\n",
    "            ptr.prev = self.Head\n",
    "            return \n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next != None):\n",
    "                temp = temp.next\n",
    "            temp.next = ptr\n",
    "            ptr.prev = self.Head\n",
    "    \n",
    "    def Deletion_at_rear(self):\n",
    "        if (self.Head == None):\n",
    "            first_Node  = self.Head\n",
    "            self.Head = self.Head.next\n",
    "            first_Node.prev = None\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next.next != None):\n",
    "                temp = temp.next\n",
    "            end_node = self.Head\n",
    "            temp.next = temp.next.next\n",
    "            end_node.prev = None\n",
    "    \n",
    "    def Traverse(self):\n",
    "        temp = self.Head\n",
    "        while (temp != None):\n",
    "            print(temp.elements)\n",
    "            temp = temp.next\n",
    "            "
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 76,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "18\n",
      "45\n"
     ]
    }
   ],
   "source": [
    "malingray = DDouble_Linked_List()\n",
    "malingray.Insertion_at_rear(18)\n",
    "malingray.Insertion_at_rear(45)\n",
    "malingray.Insertion_at_rear(89)\n",
    "malingray.Insertion_at_rear(32)\n",
    "malingray.Deletion_at_rear()\n",
    "malingray.Deletion_at_rear()\n",
    "malingray.Traverse()"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 30,
   "metadata": {},
   "outputs": [],
   "source": [
    "class DC_Node(object):\n",
    "\n",
    "    def __init__(self,elements):\n",
    "        self.elements = elements\n",
    "        self.next = None\n",
    "        self.prev = None\n",
    "\n",
    "class DC_Node_Link(object):\n",
    "\n",
    "    def __init__(self):\n",
    "        self.Head = None\n",
    "\n",
    "    def Insertion_at_rear(self,ele):\n",
    "        ptr = DC_Node(ele)\n",
    "        if (self.Head == None):\n",
    "            self.Head = ptr\n",
    "            ptr.next = self.Head\n",
    "            ptr.prev = self.Head\n",
    "            return\n",
    "        else:\n",
    "            temp = self.Head\n",
    "            while (temp.next != self.Head):\n",
    "                temp = temp.next\n",
    "            temp.next = ptr\n",
    "            ptr.prev = self.Head\n",
    "    \n",
    "    def Traverse(self):\n",
    "        temp = self.Head\n",
    "        while (temp != None):\n",
    "            print(temp.elements)\n",
    "            temp = temp.next\n",
    "            if (temp == self.Head):\n",
    "                break\n",
    "            "
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 31,
   "metadata": {},
   "outputs": [
    {
     "ename": "AttributeError",
     "evalue": "'NoneType' object has no attribute 'next'",
     "output_type": "error",
     "traceback": [
      "\u001b[1;31m---------------------------------------------------------------------------\u001b[0m",
      "\u001b[1;31mAttributeError\u001b[0m                            Traceback (most recent call last)",
      "\u001b[1;32m~\\AppData\\Local\\Temp/ipykernel_6620/1031543756.py\u001b[0m in \u001b[0;36m<module>\u001b[1;34m\u001b[0m\n\u001b[0;32m      2\u001b[0m \u001b[0mdg\u001b[0m\u001b[1;33m.\u001b[0m\u001b[0mInsertion_at_rear\u001b[0m\u001b[1;33m(\u001b[0m\u001b[1;36m18\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0;32m      3\u001b[0m \u001b[0mdg\u001b[0m\u001b[1;33m.\u001b[0m\u001b[0mInsertion_at_rear\u001b[0m\u001b[1;33m(\u001b[0m\u001b[1;36m45\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[1;32m----> 4\u001b[1;33m \u001b[0mdg\u001b[0m\u001b[1;33m.\u001b[0m\u001b[0mInsertion_at_rear\u001b[0m\u001b[1;33m(\u001b[0m\u001b[1;36m81\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0m\u001b[0;32m      5\u001b[0m \u001b[0mdg\u001b[0m\u001b[1;33m.\u001b[0m\u001b[0mInsertion_at_rear\u001b[0m\u001b[1;33m(\u001b[0m\u001b[1;36m24\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0;32m      6\u001b[0m \u001b[0mdg\u001b[0m\u001b[1;33m.\u001b[0m\u001b[0mTraverse\u001b[0m\u001b[1;33m(\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n",
      "\u001b[1;32m~\\AppData\\Local\\Temp/ipykernel_6620/3755704248.py\u001b[0m in \u001b[0;36mInsertion_at_rear\u001b[1;34m(self, ele)\u001b[0m\n\u001b[0;32m     20\u001b[0m         \u001b[1;32melse\u001b[0m\u001b[1;33m:\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0;32m     21\u001b[0m             \u001b[0mtemp\u001b[0m \u001b[1;33m=\u001b[0m \u001b[0mself\u001b[0m\u001b[1;33m.\u001b[0m\u001b[0mHead\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[1;32m---> 22\u001b[1;33m             \u001b[1;32mwhile\u001b[0m \u001b[1;33m(\u001b[0m\u001b[0mtemp\u001b[0m\u001b[1;33m.\u001b[0m\u001b[0mnext\u001b[0m \u001b[1;33m!=\u001b[0m \u001b[0mself\u001b[0m\u001b[1;33m.\u001b[0m\u001b[0mHead\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m:\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0m\u001b[0;32m     23\u001b[0m                 \u001b[0mtemp\u001b[0m \u001b[1;33m=\u001b[0m \u001b[0mtemp\u001b[0m\u001b[1;33m.\u001b[0m\u001b[0mnext\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0;32m     24\u001b[0m             \u001b[0mtemp\u001b[0m\u001b[1;33m.\u001b[0m\u001b[0mnext\u001b[0m \u001b[1;33m=\u001b[0m \u001b[0mptr\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n",
      "\u001b[1;31mAttributeError\u001b[0m: 'NoneType' object has no attribute 'next'"
     ]
    }
   ],
   "source": [
    "dg = DC_Node_Link()\n",
    "dg.Insertion_at_rear(18)\n",
    "dg.Insertion_at_rear(45)\n",
    "dg.Insertion_at_rear(81)\n",
    "dg.Insertion_at_rear(24)\n",
    "dg.Traverse()"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": null,
   "metadata": {},
   "outputs": [],
   "source": []
  }
 ],
 "metadata": {
  "kernelspec": {
   "display_name": "Python 3.9.2 64-bit",
   "language": "python",
   "name": "python3"
  },
  "language_info": {
   "codemirror_mode": {
    "name": "ipython",
    "version": 3
   },
   "file_extension": ".py",
   "mimetype": "text/x-python",
   "name": "python",
   "nbconvert_exporter": "python",
   "pygments_lexer": "ipython3",
   "version": "3.9.2"
  },
  "orig_nbformat": 4,
  "vscode": {
   "interpreter": {
    "hash": "b44dec303c593d8d8daa19f9928a44a58f5dd6858780405ef540750c1cbc0680"
   }
  }
 },
 "nbformat": 4,
 "nbformat_minor": 2
}