Python_DSA/circularLinkedlist.py at main · GUNASRIJ11/Python_DSA · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
# class node:
#     def __init__(self,data):
#         self.data=data
#         self.next = None


# class Linkedlist:
#     def __init__(self):
#         self.head = None
#         self.tail = None


#     def add_element(self, data):
#         new_node = node(data)
#         if self.head == None:
#             self.head = new_node
#             self.tail = new_node
#         else:
#             self.tail.next = new_node
#             self.tail = new_node


#     def printlist(self):
#         if self.head ==None:
#             return
#         temp =self.head
#         while(temp.next!=None):
#             print(temp.data, end=" ")
#             temp = temp.next
#             if temp.next == self.head:
#                 break
#         print(temp.data)


# list1 = Linkedlist()
# node1 = node(10)
# node2 = node(20)
# node3 = node(30)
# node4 = node(40)
# node5 = node(50)
# node6 = node(60)
# node7 = node(70)

# list1.head = node1
# node1.next = node2
# node2.next = node3
# node3.next = node4
# node4.next = node5
# node5.next = node6
# node6.next = node7
# node7.next = list1.head

# result  = Linkedlist.printlist(list1)


# -----------------------------------------------------------------------------------------


class node:
    def __init__(self,data):
        self.data=data
        self.next = None


class Linkedlist:
    def __init__(self):
        self.head = None
        self.tail = None


    def addbegin(self,data):
        newnode = node(data)
        if self.head ==None:
            self.head = newnode

            self.tail = newnode
            self.next = self.head

        else:
            newnode.next = self.head
            self.head = newnode


    def addend(self, data):
        newnode =node(data)
        if self.head == None:
            self.head = newnode
            self.tail = newnode
            self.next = self.head
        else:
            self.tail.next=newnode
            self.tail = newnode
            self.tail.next  = self.head

    def delbegin(self):
        if self.head==None:
            return
        else:
            self.head =self.head.next
            self.tail.next = self.head

    def delend(self):
       def delend(self):
        if self.head is None:
            return
        else:
            temp = self.head
            while temp.next != self.tail:
                temp = temp.next
            temp.next = self.head
            self.tail = temp


    def display(self):

        if self.head ==None:
            return
        temp =self.head
        while(temp.next!=None):
            print(temp.data, end=" ")
            temp = temp.next
            if temp.next == self.head:
                break
        print(temp.data)


list1 = Linkedlist()
list1.addbegin(10)
list1.addbegin(20)
list1.addbegin(30)
list1.addbegin(30)
list1.addbegin(40)
list1.addbegin(50)
list1.addend(2)
list1.addend(3)
list1.addend(4)
list1.addend(5)
list1.addend(4)
list1.addend(5)
list1.display()
list1.delbegin()
list1.display()
list1.delend()
list1.display()