Assume you have a class SLNode representing a node in a singly-linked list and avariable called list referencing the first element on a list of integers, as shown below:public class SLNode {private E data;private SLNode next;public SLNode( E e){ data = e; next = null; }public SLNode getNext() { return next; }public void setNext( SLNoden){ next = n; }}SLNode list;Write a fragment of Java code that would append a new node with data value 21 atthe end of the list. Assume that you don't know if the list has any elements in it ornot (i.e., it may be empty). Do not write a complete method, but just show anecessary fragment of code.

We are using list and tail here because these are the pointer which will add or append the new node…

Write a fragment of Java code that would append a new node with data value 21 at the end of the list. Assume that you don't know if the list has any elements in it or hot (i.e., it may be empty). Do not write a complete method, but just show a necessary fragment of code.

Write a fragment of Java code that would append a new node with data value 21 at the end of the list. Assume that you don't know if the list has any elements in it or hot (i.e., it may be empty). Do not write a complete method, but just show a necessary fragment of code.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

template <class T> class List; template <class T> class Node{ friend class List<T>; private: T data; Node* link; }; template <class T> class List{ public: List(){first = 0;} void InsertBack(const T& e); void Concatenate(List<T>& b); void Reverse(); class Iterator{ …. }; Iterator Begin(); Iterator End(); private: Node* first; }; I need algorithm , I think it may use iterator to complile. The question shows on below photo.
Course: Data Structure and Algorithms Language: C++ Question is well explained Question #2Implement a class for Circular Doubly Linked List (with a dummy header node) which stores integers in unsorted order. Your class definitions should look like as shown below: class CDLinkedList;class DNode {friend class CDLinkedList;private int data;private DNode next;private DNode prev;};class CDLinkedList {private:DNode head; // Dummy header nodepublic CDLinkedList(); // Default constructorpublic bool insert (int val); public bool removeSecondLastValue (); public void findMiddleValue(); public void display(); };
7. ASK class DoublyLinkedList<E> {// define ListNode elements specific for this type of list, indicating current, previous and next// consider head as name for previous node, and tail for the next one.private ListNode<E> head;private ListNode<E> current;private ListNode<E> tail; // default constructorpublic DoublyLinkedList(){//*** Task #1: implement a default constructor here, initializing the nodes to null } // method that calculates the length of the listpublic int length(){//*** Task #2: implement the method navigating through the list until you run out of elements } // method that adds a node at the beginning of the listpublic void addANodeToStart(E addData){//*** Task #3: implement this method, taking into consideration that the head will be replaced by a new node. You may want to use a temporary variable } // accessor method that gets data at current nodepublic E getDataAtCurrent(){//*** Task #4: implement this method making sure to take into account…
6. Suppose that we have defined a singly linked list class that contains a list of unique integers in ascending order. Create a method that merges the integers into a new list. Note the additional requirements listed below. Notes: ● . Neither this list nor other list should change. The input lists will contain id's in sorted order. However, they may contain duplicate values. For example, other list might contain id's . You should not create duplicate id's in the list. Important: this list may contain duplicate id's, and other list may also contain duplicate id's. You must ensure that the resulting list does not contain duplicates, even if the input lists do contain duplicates.
X1222: Double Ended Queue: Deque A double ended queue, known as deque, is a queue data structure that allows adding and removing elements from both ends of the queue. Instead of enqueue and dequeue, it has insert, delete, and get for both front and last of the queue as shown below. The data stored internally is stored in a ListNodesPlus object. The basic class definition is shown below: public class Deque { private ListNodePlus elements; // code ommitted for space public void clear() {...}; public int numElements () {...}; public boolean isEmpty() {...}; ● // Implement the following four methods public void insertFront (E it) { } public E deleteFront () { } public void insertLast (E it) { } public E deleteLast() { } Write the following four methods: • insertFront (E it) takes it and adds it to the front of the queue. stored internally in elements. The front of the queue is defined as position 0 in the queue. ● deleteFront () removes the element at the front of the queue and returns it.…
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; } }
Class Name: Exercise24_03 JAVA The MyLinkedList class used in LiveExample 24.5 is a one-way directional linked list that enables one-way traversal of the list. Modify the Node class to add the new data field name previous to refer to the previous node in the list, as follows: public class Node {E element;Node next;Node previous;public Node(E e) {element = e;}} Implement a new class named TwoWayLinkedList that uses a doubly linked list to store elements. Define TwoWayLinkedList to implements MyList. You need to implement all the methods defined in MyLinkedList as well as the methods listIterator() and listIterator(int index). Both return an instance of java.util.ListIterator (see Figure 20.4). The former sets the cursor to the head of the list and the latter to the element at the specified index. Test your new class using this code from https://liveexample.pearsoncmg.com/test/Exercise24_03.txt. Sample output: Enter 5 integers: 1.23.45.67.89.11.2 3.4 10.55 7.8 9.1 9.1 7.8 10.55 3.4
Class Name: Exercise24_03 JAVA The MyLinkedList class used in LiveExample 24.5 is a one-way directional linked list that enables one-way traversal of the list. Modify the Node class to add the new data field name previous to refer to the previous node in the list, as follows: public class Node {E element;Node next;Node previous;public Node(E e) {element = e;}} Implement a new class named TwoWayLinkedList that uses a doubly linked list to store elements. Define TwoWayLinkedList to implements MyList. You need to implement all the methods defined in MyLinkedList as well as the methods listIterator() and listIterator(int index). Both return an instance of java.util.ListIterator (see Figure 20.4). The former sets the cursor to the head of the list and the latter to the element at the specified index. Test your new class using this code from https://liveexample.pearsoncmg.com/test/Exercise24_03.txt.
In this assignment, you will create a Linked List data structure variant called a “Circular Linked List”. The Node structure is the same as discussed in the slides and defined as follows (we will use integers for data elements): public class Node { public int data; public Node next; } For the Circular Linked List, its class definition is as follows: public class CircularLinkedList { public int currentSize; public Node current; } In this Circular Linked List (CLL), each node has a reference to an existing next node. When Node elements are added to the CLL, the structure looks like a standard linked list with the last node’s next pointer always pointing to the first. In this way, there is no Node with a “next” pointer in the CLL that is ever pointing to null. For example, if a CLL has elements “5”, “3” and “4” and “current” is pointing to “3”, the CLL should look like: Key observations with this structure: The currentSize is 3 meaning there…
My data structure doesn't seem to work, please help me Data.h: #pragma once class List{private:typedef struct node{int data; node* next; }* nodePtr;nodePtr head;nodePtr curr; nodePtr temp; public: List();void AddNode(int addData);void DeleteNode(int delData);void PrintList();};Implementation.cpp: #include <iostream>#include "Data.h"using namespace std; List::List(){head = NULL;curr = NULL;temp = NULL;}void List::AddNode(int addData){nodePtr n = new node;n->next = NULL;n->next = addData;if(head !=NULL){curr = head;while(curr->next !=NULL){curr = curr->next;}curr->next = n;}else{head = n;} }void List::DeleteNode (int delData){nodePtr delPtr = NULL;temp = head;curr = head;while (curr != NULL && curr->data != delData){temp = curr;curr = curr->next;}if (curr == NULL){cout << delData << "is not on the list\n";delete delPtr;}else{delPtr = curr;curr = curr->next;temp->next = curr;if (delPtr == head){head = head->next;temp = NULL;}delete…
1. Create a doubly-linked list of string and add the following methods Add at the head b. Add at the tail Remove from head 4. Remove from tail
Computer Science QuestionConsider the adjacency list (list of neighbors) data structure for representing a graph. struct node{int data; node * next;};class Graph { …………private:node neighborList[30];int last;};Write a method to print the neighbors of a given node n, void Graph::print(int n){??????}