File tree Expand file tree Collapse file tree 1 file changed +44
-0
lines changed
data_structures/linked_list Expand file tree Collapse file tree 1 file changed +44
-0
lines changed Original file line number Diff line number Diff line change
1
+ class node : #define a class named node having data and ref as attributes
2
+ def __init__ (self ,data ):
3
+ self .data = data
4
+ self .ref = None
5
+ class LinkedList :
6
+ def __init__ (self ): #define head of the linked list i.e initiate the linked list
7
+ self .head = None
8
+ def print_LL (self ): # to print the linked list
9
+ if self .head is None :
10
+ print ("The Linked List is empty " )
11
+ else :
12
+ n = self .head
13
+ while n is n ot None :
14
+ print (n .data )
15
+ n = n .ref
16
+ def add_begin (self ,data ): #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
19
+ self .head = new_node
20
+ def add_end (self ,data ):
21
+ new_node = node (data )
22
+ if self .head is None :
23
+ self .head = new_node
24
+ else :
25
+ n = self .head
26
+ while n .ref is not None :
27
+ n = n .ref
28
+ n .ref = new_node
29
+ def add_after (self ,data ,x ):
30
+ n = self .head
31
+ while n is not None :
32
+ if x == n .data :
33
+ 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
+ linked_list .add_end (100 )
41
+ linked_list .add_begin (22 )
42
+ linked_list .add_after (30 ,11 )
43
+ linked_list .print_LL ()
44
+ #https://youtu.be/xRTdfZsAz6Y?si=EMrqVJpXjDDz1kEF
You can’t perform that action at this time.
0 commit comments