Write a pseudocode that would insert 21 to the end of the singly linked-list. What's the running time of this operation? head 28 19 45 T 13 tail newNode 21

Explain the deletion process for an element in arrays and in linked lists.

How do you write a function that can reverse a linked-list?

I'm trying to delete a node after inputting data for 2-3 checks but the node I try to delete remains in the list. How do I fix my deleteCheck() function to run correctly with the rest of my code? Thank you. #include <stdio.h>#include <stdlib.h>// Austin Chong// The core concept of this assignment is to use a linked list in a C program.// 07 March 2020 struct checkNode{int checkNumber;char date[8];char paidTo[100];char description[100];double amount;struct checkNode *head;struct checkNode *next;}; struct checkNode *checkBook = NULL; /* Functions */ void addCheck(){int checkNumber;double amount;char temp;struct checkNode *newCheck = (struct checkNode*) malloc(sizeof(struct checkNode));printf("Please enter the check number: ");scanf("%d", &checkNumber);newCheck -> checkNumber = checkNumber;printf("Please enter the amount: ");scanf("%lf", &amount);newCheck -> amount = amount;printf("Please enter the date: ");scanf("%c", &temp);scanf("%[^\n]", newCheck ->…

Let S be a stack with the following elements, 6,13,15,17,35,45,20,55. Implement the stack using an Array and Linked-list

Write a pseudocode that allows insertion of -7 to the begin of the singly linked- list. What is the running time of this operation? newNode head i 13 18 36 52

Trace the execution of Selection-sort on the list: 30, 7, 21, 42, 57, 90, 3, 11

Write  a program in java to primr the elements of set using loop.

can I have the solution for this question in Java coding please? Write an algorithm for the following to swap two adjacent elements by adjusting only the links (and not the data) using: Singly-linked lists. Doubly linked lists.

Which of the following must be done, along other steps, when inserting at the end of a singly linked list? tail = newNode; head = null; tail = null; head = tail; %3D