代写C++代码 代做C++程序 C++辅导 C++教学

ECE 263/ECE 264

Warm-up Exercise 1:

Create the followingstructure:

struct node

{

intdata;

structnode*next;

};

Then in main do the following:

·         Create a single-node list

·         Add  a new node to the end

·         Display the entirelist

·         Freethe entirelist

Warm-up Exercise 2:

·         Modifywarm-up exercise 1to afunction with the name ofcreateList()to create alinked list

structnode*createList(void);

·         Adda function called displayList()to displaythelist

voiddisplayList(structnode*head);

·         Add afunction called freeList()to freethe entirelist

voidfreeList(structnode*head);

Warm-up Exercise 3:

Modifywarm-up exercise 2 to add a new function addNodeToBackto insert anew node to the end beforefreeingmemory

struct node*addNodeToBack (structnode*head);

Warm-up Exercise 4:

Modifywarm-up exercise 3to add a new functionaddNodeToFronttoainsert nodeto the front beforefreeingmemory

struct node*addNodeToFront(structnode*head);

Warm-up Exercise 5:

You are about to write a functiondelete_ith_node that will make a linked list of integer numbers and this function will ask the user ith node to be deleted and then delete the ith node in the linked list

struct node*delete_ith_node(structnode*head, inti);

Warm-up Exercise 6:

You are about to write a function add_newnode_to_iwill ask the user ith node to be added and then add a new node the ith node in the linked list

struct node*add_newnode_to_i(structnode*head, inti)

(Lab 11)This needs to be turned in:

You are about to call a function that creates (which is discussed in the warm up) a linked list and then you call function delete_target_node that will delete the target node in the linked list

struct node*delete_ith_node(structnode*head ,struct node* node_to_be_deleted);