Remove Odd Values from Linked List

Problem Statement

Remove Odd Values from Linked List Problem Description Given a linked list of integers, return a reference to the head of a similar linked list with all odd values removed. Examples Example 1: Input: A linked list with values 2 -> 1 -> 3 -> 4 -> 6 . Output: A linked list with values 2 -> 4 -> 6 . Explanation: The odd values (1 and 3) are removed from the original linked list. Constraints 1 5 1 9 Input Format for Custom Testing The first line contains an integer n , the number of nodes in the list. Each of the next n lines contains an integer node->data . Function Signature Complete the deleteOdd function below. The function is expected to return an INTEGER_SINGLY_LINKED_LIST_NODE . The function accepts INTEGER_SINGLY_LINKED_LIST_NODE listHead as parameter. /* * For your reference: * * SinglyLinkedListNode { * int data; * SinglyLinkedListNode next; * } * */ public static SinglyLinkedListNode deleteOdd(SinglyLinkedListNode listHead) { // Write your code here }