|
1 | 1 | class Node:
|
2 |
| - def __init__(self,data:int)->None: |
3 |
| - self.data=data |
4 |
| - self.ref= None |
| 2 | + def __init__(self, data: int) -> None: |
| 3 | + self.data = data |
| 4 | + self.ref = None |
| 5 | + |
| 6 | + |
5 | 7 | class LinkedList:
|
6 |
| - def __init__(self)->None: |
7 |
| - self.head=None |
| 8 | + def __init__(self) -> None: |
| 9 | + self.head = None |
| 10 | + |
8 | 11 | def print_ll(self):
|
9 | 12 | if self.head is None:
|
10 | 13 | print("The Linked List is empty ")
|
11 | 14 | else:
|
12 |
| - n= self.head |
| 15 | + n = self.head |
13 | 16 | while n is not None:
|
14 | 17 | print(n.data)
|
15 |
| - n=n.ref |
16 |
| - def add_begin(self,data)->None: #to add a node in the beginning |
17 |
| - new_node= Node(data) #define data of the new node |
18 |
| - new_node.ref= self.head #make the ref or adress of node to the head node |
| 18 | + n = n.ref |
| 19 | + |
| 20 | + def add_begin(self, data) -> None: # to add a node in the beginning |
| 21 | + new_node = Node(data) # define data of the new node |
| 22 | + new_node.ref = self.head # make the ref or adress of node to the head node |
19 | 23 | self.head = new_node
|
20 |
| - def add_end(self,data)->None: |
21 |
| - new_node= Node(data) |
| 24 | + |
| 25 | + def add_end(self, data) -> None: |
| 26 | + new_node = Node(data) |
22 | 27 | if self.head is None:
|
23 |
| - self.head=new_node |
| 28 | + self.head = new_node |
24 | 29 | else:
|
25 |
| - n=self.head |
| 30 | + n = self.head |
26 | 31 | while n.ref is not None:
|
27 |
| - n=n.ref |
28 |
| - n.ref=new_node |
29 |
| - def add_after(self,data,x)->None: |
30 |
| - n=self.head |
| 32 | + n = n.ref |
| 33 | + n.ref = new_node |
| 34 | + |
| 35 | + def add_after(self, data, x) -> None: |
| 36 | + n = self.head |
31 | 37 | while n is not None:
|
32 |
| - if x==n.data: |
| 38 | + if x == n.data: |
33 | 39 | break
|
34 |
| - n=n.ref |
35 |
| - new_node=Node(data) |
36 |
| - new_node.ref= n.ref |
37 |
| - n.ref= new_node |
38 |
| -linked_list= LinkedList() # main driver function here we define the linked list |
39 |
| -linked_list.add_begin(11) #added 11 to the beginning of out linked list |
| 40 | + n = n.ref |
| 41 | + new_node = Node(data) |
| 42 | + new_node.ref = n.ref |
| 43 | + n.ref = new_node |
| 44 | + |
| 45 | + |
| 46 | +linked_list = LinkedList() # main driver function here we define the linked list |
| 47 | +linked_list.add_begin(11) # added 11 to the beginning of out linked list |
40 | 48 | linked_list.add_end(100)
|
41 | 49 | linked_list.add_begin(22)
|
42 |
| -linked_list.add_after(30,11) |
| 50 | +linked_list.add_after(30, 11) |
43 | 51 | linked_list.print_ll()
|
44 |
| -#https://youtu.be/xRTdfZsAz6Y?si=EMrqVJpXjDDz1kEF |
| 52 | +# https://youtu.be/xRTdfZsAz6Y?si=EMrqVJpXjDDz1kEF |
0 commit comments