Remove Odd Values from Linked List

Problem Statement

Remove Odd Values from Linked List Problem Description You are given a singly linked list of positive integers. Remove every node whose value is odd and return the head of the linked list that remains. The surviving (even-valued) nodes must keep their original relative order. If every node holds an odd value, the resulting list is empty and you must return the null head. Function Signature Complete the deleteOdd function. It receives listHead , the head node of the linked list, and returns the head node of the list after every odd value has been removed (the null head if nothing survives). The node type is already defined for you: SinglyLinkedListNode { int data SinglyLinkedListNode next } Input Format The input is read by the provided harness; you only write deleteOdd . The first line contains an integer n , the number of nodes in the list. Each of the next n lines contains one integer, the data of the next node, given from head to tail. Output Format The provided harness prints the l