Question 6 Linked Lists lend themselves easily to recursive solutions. and it is common to traverse a list by processing a single element and then recursively calling the function on the remaining sub-list. Il does this by accepting a pointer to the current position in the list es a parameter. In the answers below. this has been referred to as the list pointer. what criteria is oten used as the base case that ends the recursion and allos the function to return to he original cal? The data element of the nade pointed to by the list pointer is storing-1. The list pointer points to the beginning of the ist. The list pointer is NULL None of the above. Question 7 when designing the Node structure for our linked list which attributes should we include? Select all that apply. A deta element to store whatever the list is supposed to store. A Node pointer to serve as the head of the list. © A Node pointer to the next element in the list. None of the above.

Let xHead, yHead and zHead be the head pointers of 3 linked lists of integers (called X-list, Y-list and Z-list, respectively, from here). X-list and Y-list are each sorted (in non-decreasing order) in itself and each may be empty. Z-list is initially empty (i.e., zHead initially contains the null pointer). Develop and test a recursive C++ function called Merge2AscListsRecur that combines the nodes in X-list and Y-list into Z-list such that, after calling the function, Z-list is a sorted list (in non-decreasing order) containing all the nodes initially contained in X-list and Y-list  –  X-list and Y-list should both be empty after the call.   Other specifications/requirements:   ● Each node of the list has the following structure:       struct Node{   int data;   Node *link;};   ● The function should:     ► Have only three parameters (each a pointer-to-Node) and no return value (be a void function).     ► Not use any global variables or static local…

Let xHead, yHead and zHead be the head pointers of 3 linked lists of integers (called X-list, Y-list and Z-list, respectively, from here). X-list and Y-list are each sorted (in non-decreasing order) in itself and each may be empty. Z-list is initially empty (i.e., zHead initially contains the null pointer). Develop and test a recursive C++ function called SortedMergeRecur that combines the nodes in X-list and Y-list into Z-list such that, after calling the function, Z-list is a sorted list (in non-decreasing order) containing all the nodes initially contained in X-list and Y-list  –  X-list and Y-list should both be empty after the call.   Other specifications/requirements:   ● Each node of the list has the following structure:       struct Node{   int data;   Node *link;};   ● The function should:     ► Have only three parameters (each a pointer-to-Node) and no return value (be a void function).     ► Not use any global variables or static local…

Add a new public member function to the LinkedList class named reverse() which reverses the items in the list.  You must take advantage of the doubly-linked list structure to do this efficiently as discussed in the videos/pdfs, i.e. swap each node’s prev/next pointers, and finally swap headPtr/tailPtr.  Demonstrate your function works by creating a sample list of a few entries in main(), printing out the contents of the list, reversing the list, and then printing out the contents of the list again to show that the list has been reversed.   Note: your function must actually reverse the items in the doubly-linked list, not just print them out in reverse order! Note: we won't use the copy constructor in this assignment, and as such you aren't required to update the copy constructor to work with a doubly-linked list.   This is what I have so far but its not working! template<class ItemType>void LinkedList<ItemType>::reverse(){   Node<ItemType>*curPtr,*prev,*next;…

CAN THE SOLUTION BE SUBMITTED WITH TEXT AND NOT A PDF IMAGE PLEASE!   This assignment requires you to write a non-verbose input-driven java program for maintaining a binary search tree (BST) of integer elements (negative, zero or positive). The speciality of your BST will be that itwill record the frequency of occurrence for each integer element in it. Actions provisioned on the BST. When your program is running, a user should be able to select one of the following actions to be performed on the BST. 1. Insert an element into the BST2. Search for an element in the BST3. Find the maximum element from the BST4. Find the minimum element from the BST5. Print the elements in the BST in preorder6. Print the elements in the BST in postorder7. Print the elements in the BST in inorder8. Delete an element Anything else to exit the program. The user will provide their choice of action on the BST, by entering one of the numbers between 1 to 8 thatcorrespond to their choice. For example, if the…

Utilizing c++, write an implementation code for a linked list and incllude the ff functions below i.Being able to delete a node from any where(position). ii.Being able to add node to any position .

What are the requirements for determining if a linked list T is empty if T is one of the following: (i) a simple singly linked list, (ii) a headed singly linked list, (iii) a simple circularly linked list, or (iv) a headed circularly linked list?

For a singly linked list pointed at by pointer Ptr, write the implementation of a function named CountPositive that counts and prints the nodes with positive value in the list. Take in consideration all special cases. (** The declaration of the Node is: typedef struct Node { int data; Node*next; }Node;

Using only a single call to filter, map, or reduce, perform the following tasks. You must use lambda expressions for the function arguments. You may assume the input lists have at least one element. a. Given a list of strings strs, create a function call that returns an iterable object that provides the last character of each string in strs. You may assume that each string in strs has at least one character. b. A list of nonnegative fractions (called fractions) consists of tuples of two integers. The first integer in each tuple is the numerator (must be greater than or equal to zero) and the second integer in each tuple is the denominator (must be strictly greater than zero). Given this list fractions, create a function call that returns the fraction with the highest value. If there are multiple fractions tied for the highest value, it suffices to return any one of them.