4. (20%) Write a pseudocode function that removes the nodes in even positions (the second, fourth, sixth, and so forth) in a given linked list. No return values are expected. Note: A node in a null-terminated linked list has one pointer, named 'next', that points to the next node if it is not null.

5. (20%) Given a reference that points to a node x in a doubly circular linked list. Please write a pseudocode function to delete the node x from the doubly circular linked list. No return values are expected. Note: A node in a doubly circular linked list has two pointers, named 'next' and 'prev', respectively, where the 'next' pointer is used to find the next node and the ' prev' pointer is used to find the previous

4. (20%) Write a pseudocode function that removes the nodes in even positions (the second, fourth, sixth, and so forth) in a given linked list. No return values are expected. Note: A node in a null-terminated linked list has one pointer, named 'next', that points to the next node if it is not null.

其他申論題