Assume a Node class has been defined using the Node class implementation in your textbook, except that the data members have been declared public instead of private. This means that the code shown below has direct access to the data members defined inside the Node class. Type the EXACT output of the following code segment. You may assume that the code compiles and executes without errors. Node *ptr%; Node *ptr2; Node *top; char ch; ptr1: = new Node; top = ptr1; ptr1->item = 'S'; %3D ptr1 = new Node; top->next = ptr1; ptr1->item = 'R'; for (ch = 'E'; ch >= 'A'; ch--) { ptr2 = new Node; %3D ptr1->next = ptr2; %3D ptr2->item = ch; %3D ptr1 = ptr1 -> next; %3D } ptr1->next = nullptr; ptr2 = top->next; ptr2 = ptr2->next; %3D ptr1 = ptr2->next; ptr1 = ptr1->next; %3D cout << ptr1->item << " "; cout << ptr2->item << " "; ptr2 = ptr2->next; ptr1 = top->next; %3D cout << ptr1->item << " "; cout << ptr2->item << " "; cout << top->item << endl;

I need to convert this code using C++, that currently works with structs into classes, with the main class being called myGraph and a node class (if necessary) using composition. #include <stdio.h>#include <stdlib.h>#include <iostream>using namespace std; struct AdjListNode //node class{ int dest; struct AdjListNode* next;}; struct AdjList //node class{ struct AdjListNode *head; }; struct Graph //myGraph class{ int V; struct AdjList* array;}; struct AdjListNode * newAdjListNode(int dest){ struct AdjListNode * newNode = new AdjListNode; newNode->dest = dest; newNode->next = NULL; return newNode;} struct Graph* createGraph(int V) //constructor{ struct Graph* graph = new Graph; graph->V = V; graph->array = new AdjList; int i; for (i = 0; i < V; ++i) graph->array[i].head = NULL; return graph;} void addEdge(struct Graph* graph, int src, int dest){ struct AdjListNode* newNode =...

1. Complete the function evaluate_postfix(String exp): Input: "10 23 - 5 15 + +" Retur: 7 Node.java public class Node {Object info;Node next;Node(Object info, Node next){this.info=info;this.next=next;}}// "((1+2)"// ['(','(','1','+','2',')']// stack : ')' -> '2' -> '1' -> '(' -> '(' -> null Stack.java public class Stack {private Node top;public Stack() {top = null;}public boolean isEmpty() {return (top == null);}public void push(Object newItem) {top = new Node(newItem, top);}public Object pop() {if (isEmpty()) {System.out.println("Trying to pop when stack is empty");return null;} else {Node temp = top;top = top.next;return temp.info;}}void popAll() {top = null;}public Object peek() {if (isEmpty()) {System.out.println("Trying to peek when stack is empty");return null;} else {return top.info;}}} Runner.java public class Runner {public static void main(String[] args) {String expression1 = "((1+2)))))+(2+2))(1/2)";boolean res =...

Given the following C code: struct Node int data; struct Node struct Node next; prev; struct Node head; void funx ( ) if (head==NULL) return; struct Node current=head; while (current->next!=NULL) current=current-->next; while (current!=NULL) printf("&d ", current->data; current=current->prev; What is the functionality of this function? a) Print the contents of linked list b) Print the contents of linked list in reverse order c) None

#include <iostream> usingnamespace std; class Queue { int size; int* queue; public: Queue(){ size = 0; queue = new int[100]; } void add(int data){ queue[size]= data; size++; } void remove(){ if(size ==0){ cout <<"Queue is empty"<<endl; return; } else{ for(int i =0; i < size -1; i++){ queue[i]= queue[i +1]; } size--; } } void print(){ if(size ==0){ cout <<"Queue is empty"<<endl; return; } for(int i =0; i < size; i++){ cout<<queue[i]<<" <- "; } cout << endl; } //your code goes here }; int main(){ Queue q1; q1.add(42); q1.add(2); q1.add(8); q1.add(1); Queue q2; q2.add(3); q2.add(66); q2.add(128); q2.add(5); Queue q3 = q1+q2; q3.print();...

In java The following is a class definition of a linked list Node:class Node{int info;Node next;}Assume that head references a linked list and stores in order, the int values 5, 7 and 9. Show the instructions needed to delete the Node with 5 so that head would reference the list 7 and 9.

what is the problem in the display function ? the code : #include <iostream>using namespace std; class node{public: int data; node* next;}; void display(node * head) // printing the data of the nodes{ node* temp = head; while (temp != NULL) { cout << temp->data << endl; temp = temp->next; }} // add void push(node** head, int newdata) // { 5, 10 , 20 , 30 , 40 }{ node* newnode = new node(); newnode->data = newdata; newnode->next = *head; *head = newnode;} void append(node** head, int newdata) // { 10 , 20 , 30 , 40 }{ node* newnode = new node(); newnode->data = newdata; newnode->next = NULL; node* last = *head; if (*head == NULL) { *head = newnode; return; } while (last->next != NULL) { last = last->next; } last->next = newnode;} void insertafter(node*...

1.Assume some Node class with info link fields . Complete this method in class List that returns a reference to the node containing the data item in the argument findThis, Assume that findThis is in the list public class list { protected Node head ; Protected int size ; Public Node find (char find this) { Node curr = head; while(curr != null) { if(curr.info == findThis) return curr; curr = curr.link; } return -1; } }