(self, pos, data)
| 34 | del temp |
| 35 | |
| 36 | def insert(self, pos, data): |
| 37 | if pos < 0 or pos > self.length(): |
| 38 | print("Enter valid index") |
| 39 | elif pos == 0: |
| 40 | self.insert_at_head(data) |
| 41 | return |
| 42 | elif pos == self.length() - 1: |
| 43 | self.add_node(data) |
| 44 | return |
| 45 | new_node = Node(data) |
| 46 | curr_pos = 0 |
| 47 | prev = None |
| 48 | curr = self.head |
| 49 | while True: |
| 50 | if pos == curr_pos: |
| 51 | prev.next = new_node |
| 52 | new_node.next = curr |
| 53 | break |
| 54 | prev = curr |
| 55 | curr = curr.next |
| 56 | curr_pos += 1 |
| 57 | |
| 58 | def delete_head(self): |
| 59 | temp = self.head |