Phind CodeLlama 34B v2

python class Node: def __init__(self, data): self.data = data self.next = None class LinkedList: def __init__(self): self.head = None def insert(self, data): new_node = Node(data) new_node.next = self.head self.head = new_node def delete(self, data): curr = self.head if curr and curr.data == data: self.head = curr.next return while curr.next: if curr.next.data == data: curr.next = curr.next.next return curr = curr.next def print_list(self): temp = self.head while temp: print(temp.data, end=" -> ") temp = temp.next print("None") # Example usage ll = LinkedList() ll.insert(3) ll.insert(2) ll.insert(1) ll.print_list() # Output: 1 -> 2 -> 3 -> None ll.delete(2) ll.print_list() # Output: 1 -> 3 -> None

The issue is you're accessing index 5 on a vector with only 3 elements (indices 0-2), causing undefined behavior/segfault. Fix by checking bounds or resizing: cpp #include <iostream> #include <vector> using namespace std; int main() { vector<int> v = {1,2,3}; if (v.size() > 5) { cout << v; } else { cout << "Index out of bounds! Size: " << v.size() << endl; } // Or resize first: v.resize(6); cout << v << endl; // Now safe (default 0) return 0; } This prevents segfaults by validating array bounds before access.