Name:
(as it would appear on official course roster)
Umail address:	@umail.ucsb.edu	section
Optional: name you wish to be called if different from name above.
Optional: name of "homework buddy" (leaving this blank signifies "I worked alone"

h09: Chapter 13 More Linked lists

ready?	assigned	due	points
true	Sat 11/16 11:00AM	Thu 11/21 11:59PM

You may collaborate on this homework with AT MOST one person, an optional "homework buddy".

UPLOAD A PDF OF YOUR ANSWERS TO GRADESCOPE BEFORE THE DUE DATE. ASSOCIATE EACH QUESTION WITH A SPECIFIC PAGE IN YOUR HOMEWORK AT THE TIME OF SUBMISSION. There is NO MAKEUP for missed assignments;

Please:

No Staples.
No Paperclips.
No folded down corners.

Read Chapter 13, section 13.1 (pages 740- 759).

PLEASE MARK YOUR HOMEWORK CLEARLY, REGARDLESS OF IF YOU WRITE IT OUT IN INK OR PENCIL!

struct Node{
  int data;
  Node* next;
};

Complete the definition of the function deleteNode given below, that takes as input a pointer to the head of the list, and an integer value. The function should delete all the nodes in the list whose data members have the given value. If the list is empty or if there is no node with the given value, the function should not do anything. }

void deleteNode(struct Node*& head, int value);

For all the following questions, use the definitions of the struct Node and struct LinkedList from lab 07.

2.(10 pts) Implement a function that returns the number of even elements in a linked list. Test your code before writing it out. Illegible code will receive 0 credit. Below is the declaration of the function

int countEven(LinkedList* list);

3.(10 pts) Implement a function that takes a linked list and the number of elements in the list as input and returns a dynamic array containing the data elements of the linked list. Test your code before writing it out.

int* linkedListToArray(LinkedList * list, int len);