(1 of 2 parts) Suppose you have the following function that is passed the head and tail pointers of a doubly linked list of integers, along with another integer, f. * bool expecto (Node ✶ h, Node *t, int f) { if (h == nullptr || t == h->prev) return false; Node *c = h; Node * r = t; while (c != r) { c = c->next; if (c != r) } r = r->prev; if (c->value return true; f) else if (c->value < f) else return expecto (h, c->prev, f); return expecto (c->next, t, f); if (c->value == f) return true;B else if (c->value < f) else return expecto (h, c->prev, f); return expecto (c->next, t, f); In brief, discuss what this function is doing and discuss its Big-O. Are there any constraints on the values in the linked list?

[] [] partite_sets In the cell below, you are to write a function "partite_sets (graph)" that takes in a BIPARTITE graph as its input, and then returns a single list whose two entries are the partite sets of the graph as lists (the order of the sets outputed does not matter). After compiling the above cell, you should be able to compile the following cell and obtain the desired outputs. print (partite_sets({"A" : ["B", "C"], "B" : partite_sets({"A" : ["B", "C"], "B" : ["A"], "C" : ["A"]}), ["A", "D"], "C" : ["A", "D"], "D" : ["B", "C"]})) This should return [["B","C"], ["A"]] [["A","D"], ["B","C"]] (the order in which the entries appear does not matter) Python Python

Given the following C code: void funx (struct Node n) if (n--NULL) return printf ("d ",n->data) funX (n->next) What is the aim of this code for function call funX(head) where head is a pointer that points to the head of linked list? a) Print the contents of linked list b) Print the contents of linked list in reverse order c) Print even nodes of linked list d) Print even nodes of linked list in reverse order

in C++ kth ElementExtend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the definitions of these functions in the class linkedListType.   please, do not copy from any other sources, give me a fresh new code. Thank you

QUESTION: NOTE: This assignment is needed to be done in OOP(c++/java), the assignment is a part of course named data structures and algorithm. A singly linked circular list is a linked list where the last node in the list points to the first node in the list. A circular list does not contain NULL pointers. A good example of an application where circular linked list should be used is a items in the shopping cart In online shopping cart, the system must maintain a list of items and must calculate total bill by adding amount of all the items in the cart, Implement the above scenario using Circular Link List. Do Following: First create a class Item having id, name, price and quantity provide appropriate methods and then Create Cart/List class which holds an items object to represent total items in cart and next pointer Implement the method to add items in the array, remove an item and display all items.   Now in the main do the following Insert Items in list Display all items. Traverse…

In C++ Plz LAB: Grocery shopping list (linked list: inserting at the end of a list) Given main(), define an InsertAtEnd() member function in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts ItemNode.h Default Code: #include <iostream>#include <string>using namespace std; class ItemNode {private:   string item;   ItemNode* nextNodeRef; public:   // Constructor   ItemNode() {       item = "";       nextNodeRef = NULL;   }    // Constructor      ItemNode(string itemInit) {       this->item = itemInit;       this->nextNodeRef = NULL;   }    // ConstructorItemNode(string itemInit, ItemNode *nextLoc) {this->item = itemInit;this->nextNodeRef = nextLoc;}    // Insert node after this…

How does the --> work in dereferencing a pointer?

Write a function reverse_iter_for that takes a list and returns a new list that is the reverse of the original using a for loop. You should not need any indexing notation. def reverse_iter_for(lst): """Returns the reverse of the given list. >>> reverse_iter_for([1, 2, 3, 4]) [4, 3, 2, 1] TELEEL "*** YOUR CODE HERE ***" Complete the function reverse_iter_while that behaves identically to reverse_iter_for but is implemented as using a while loop. You may use indexing or slicing notation. Do not use 1st [::-1] ! def reverse_iter_while(lst): """Returns the reverse of the given list. >>> reverse_iter_while([1, 2, 3, 4]) [4, 3, 2, 1] rev_lst, i = [], 0 while i < len(lst): "*** YOUR CODE HERE ***"

Suppose a node of a doubly linked list is defined as follows:  struct Node{  int data;  struct Node* next;  struct Node* prev;  };  Write the function definition of the function deleteElement as presented below. This function deletes a node at position n from a doubly linked list.  struct Node* deleteElement(struct Node* head, int n){  //write the function definition  }

Exercise B: "Matrix Addition" For this exercise you will design and implement a function that takes two matrix arguments and computes their sum (if and only if a sum can actually be computed, returning an empty list otherwise). Two matrices can only be added together if they have exactly the same dimensions. If the dimensions are acceptable, then the matrix sum will have the same dimensions as either of the operands, and the value of each element in the matrix sum is itself the sum of the corresponding elements in the operand matrices. And although it does makes sense to test rectangularity before attempting addition, you need not perform this step (since you did it above). In order to complete this task, you will need to: ensure you know how matrix addition can be performed² ● Your submission for this exercise: