implement queue and stack ( c, C++, array, linked list) insert delete search print all elements

show the recursiontree for applying mergesort to the list 15 20 7 3 19 6 17 25 and determine the number of comparisons performed during the sort

How would the numbers be illustrated in the array order of a max heap, with the given numbers?

Which sorting algorithm is adaptable to singly linked list and why ?? Explain in detail.

Create two singly linked lists A and B to represents elements in the following set A and B respectively. A = { 5, 6, 8, 9, 10 , 11}  B = { 1, 6, 2, 9, 3, 11, 4} Develop an algorithm and implement the same to represent only intersection of two lists A and B and print the same.

Develop Java methods to perform the following operations on an unordered list (using linked lists). What is the complexity of each of these algorithms. 1. Insert an element at the start (front) of the list 2. Insert an element at the end (rear) of the list 3. Insert an element at the middle of the list  following an element already in the list. 4. Remove an element from the middle of the list

Create a sort implementation that accepts as an input a linked list of nodes with String key values and rearranges the nodes such that they appear in sorted order (returning a link to the node with the smallest key). Quicksort 3-way string is used.

The list that follows is a maximum-heap. What will the array look like after removing the node with the highest key? Prior to extraction: 30 50 16 60 59 95 77 61 72 63 30 50 16 60 59 Following extraction:

To obtain the alphabet in order, heap sort the list L =D, B, G, E, A, H, C, F. Is it possible to write all phases in pseudocode?