fix the error - class Node{ int data- Node next-.pdf

•

0 likes•2 views

fix the error : class Node{ int data; Node next; public Node(int data) { this.data = data; this.next = null; } } class singlelinkedlist { public Node head = null; public Node tail = null; public void addNode(int data) { Node newNode = new Node(data); if(head == null) { head = newNode; tail = newNode; } else { tail.next = newNode; tail = newNode; } } public void sortList() { Node current = head, index = null; int temp; if(head == null) { return; } else { while(current != null) { index = current.next; while(index != null) { if(current.data > index.data) { temp = current.data; current.data = index.data; index.data = temp; } index = index.next; } current = current.next; } } } public void display() { Node current = head; if(head == null) { System.out.println("List is empty"); return; } while(current != null) { System.out.print(current.data + " "); current = current.next; } System.out.println(); } } public class JavaApplication46 { /** * @param args the command line arguments */ public static void main(String[] args) { // TODO code application logic here SortList sList = new SortList(); sList.addNode(9); sList.addNode(7); sList.addNode(2); sList.addNode(5); sList.addNode(4); System.out.println("Original list: "); sList.display(); sList.sortList(); System.out.println("Sorted list: "); sList.display(); } }.

Education

if(current.data > index.data) {
temp = current.data;
current.data = index.data;
index.data = temp;
}
index = index.next;
}
current = current.next;
}
}
}
public void display() {
Node current = head;
if(head == null) {
System.out.println("List is empty");
return;
}
while(current != null) {
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
}
public class JavaApplication46 {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
// TODO code application logic here
SortList sList = new SortList();
sList.addNode(9);
sList.addNode(7);
sList.addNode(2);
sList.addNode(5);
sList.addNode(4);

System.out.println("Original list: ");
sList.display();
sList.sortList();
System.out.println("Sorted list: ");
sList.display();
}
}

Similar to fix the error - class Node{ int data- Node next-.pdf

coding in C; Create a function called reverseList that takes the head of a linked list, reverses the order of all the nodes. For example, if the list contained 1, 2, 3, 4 in its nodes, the list will now contain 4, 3, 2, 1. please add a main test. Solution Please find the required program below: #include<stdio.h> #include<stdlib.h> struct node { int data; struct node* next; }; void push(struct node** head, int new_element) { struct node* new_node = (struct node*) malloc(sizeof(struct node)); new_node->data = new_element; new_node->next = (*head); (*head) = new_node; } void printList(struct node *head) { struct node *temp = head; while(temp != NULL) { printf(\"%d \", temp->data); temp = temp->next; } } void reverseList(struct node** head) { struct node* prev = NULL; struct node* current = *head; struct node* next; while (current != NULL) { next = current->next; current->next = prev; prev = current; current = next; } *head = prev; } int main() { struct node* head = NULL; push(&head, 12); push(&head, 14); push(&head, 5); push(&head, 8); printf(\"\ Linked list Before Reversing :\ \"); printList(head); reverseList(&head); printf(\"\ Linked list After Reversing :\ \"); printList(head); } -------------------------------------------------------------------------------- OUTPUT: Linked list Before Reversing : 8Â Â 5Â Â 14Â Â 12 Linked list After Reversing : 12Â Â 14Â Â 5Â Â 8 .

coding in C- Create a function called reverseList that takes the head.docx

tienlivick

Help I keep getting the same error when running a code. Below is the code and the instructions about the code. import java.util.Arrays; public class Album implements Comparable { private final int id; private final String[] artists; private final int numSongs; public Album(int id, String title, String[] artists, int numSongs) { this.id = id; this.artists = new String[]{Arrays.toString(artists)}; this.numSongs = numSongs; } public int getId() { return id; } @Override public int compareTo(Album other) { return Integer.compare(this.numSongs, other.numSongs); } @Override public String toString() { StringBuilder artistNames = new StringBuilder(); for (String artist : artists) { artistNames.append(artist).append(", "); } artistNames.delete(artistNames.length() - 2, artistNames.length()); return "ID: " + id + " -- " + numSongs + " songs -- [" + artistNames + "]"; } } import java.util.Random; public class DoublyLinkedList { private static class Node { T data; Node prev; Node next; Node(T data) { this.data = data; } } private Node head; private Node tail; private int size; public DoublyLinkedList() { head = null; tail = null; size = 0; } public Node append(T data) { Node newNode = new Node<>(data); if (head == null) { head = newNode; } else { tail.next = newNode; newNode.prev = tail; } tail = newNode; size++; return newNode; } public Node insert(int location, T data) { if (location < 0 || location > size) { throw new IllegalArgumentException("Invalid location"); } Node newNode = new Node<>(data); if (location == 0) { newNode.next = head; if (head != null) { head.prev = newNode; } head = newNode; if (tail == null) { tail = newNode; } } else if (location == size) { tail.next = newNode; newNode.prev = tail; tail = newNode; } else { Node current = head; for (int i = 0; i < location; i++) { current = current.next; } newNode.prev = current.prev; newNode.next = current; current.prev.next = newNode; current.prev = newNode; } size++; return newNode; } public Node delete(int location) { if (location < 0 || location >= size) { throw new IllegalArgumentException("Invalid location"); } Node deletedNode; if (location == 0) { deletedNode = head; head = head.next; if (head != null) { head.prev = null; } else { tail = null; } } else if (location == size - 1) { deletedNode = tail; tail = tail.prev; tail.next = null; } else { Node current = head; for (int i = 0; i < location; i++) { current = current.next; } deletedNode = current; current.prev.next = current.next; current.next.prev = current.prev; } size--; return deletedNode; } public int getIndex(T data) { Node current = head; for (int i = 0; i < size; i++) { if (current.data.equals(data)) { return i; } current = current.next; } return -1; } @Override public String toString() { StringBuilder result = new StringBuilder(); Node current = head; while (current != null) { result.append(current.data).append(" -> "); current = current.next; } result.append("NULL"); return result.toString(); } public Node shuffle() { Random r.

Help I keep getting the same error when running a code. Below is the.pdf

mail931892

137 Lab-2.2.pdf

21E135MAHIESHWARJ

Linked Stack program.docx

kudikalakalabharathi

Data structures cs301 power point slides lecture 03

Nasir Mehmood

Draw memory map of this link list code and add insert at last ( java)-.pdf

Andrew8IBPatersonk

Rewrite this code so it can use a generic type instead of integers. This means we can use any data type with it. For example: LinkedList = new LinkedLIst<>(); public class Main { public static void main(String[] args) { /* * Expected output: * * The list: 8 -> 1 -> 5 -> 3 -> 6 * Size: 5 * Head: 8 * Tail: 6 * Removeing 1... * The list: 8 -> 5 -> 3 -> 6 * Size: 4 * Head: 8 * Tail: 6 * Removeing head... * The list: 5 -> 3 -> 6 * Size: 3 * Head: 5 * Tail: 6 * Removeing tail... * The list: 5 -> 3 * Size: 2 * Head: 5 * Tail: 3 */ LinkedList list = new LinkedList(); list.append(5); list.append(3); list.append(6); list.prepend(1); list.prepend(8); printListDetails(list); System.out.println("Removeing 1..."); list.removeByValue(1); printListDetails(list); System.out.println("Removeing head..."); list.removeHead(); printListDetails(list); System.out.println("Removeing tail..."); list.removeTail(); printListDetails(list); } public static void printListDetails(LinkedList list) { System.out.println("The list: " + list.toString()); System.out.println("Size: " + list.size()); System.out.println("Head: " + list.getHead()); System.out.println("Tail: " + list.getTail()); } } ________________________________________ public class LinkedList { private Node head; private Node tail; private int size; public LinkedList() { head = null; tail = null; size = 0; } public void append(int data) { Node newNode = new Node(data); if (head == null) { head = newNode; } else { tail.next = newNode; } tail = newNode; size++; } public void prepend(int data) { Node newNode = new Node(data); if (head == null) { head = newNode; tail = newNode; } else { newNode.next = head; head = newNode; } size++; } public int getHead() { return head.data; } public int getTail() { return tail.data; } public int size() { return size; } public void removeByValue(int data) { Node current = head; while (current.next != null && current.next.data != data) { current = current.next; } if (current.next != null) { current.next = current.next.next; size--; if (current.next == null) { tail = current; } } } public int removeHead() { int removedData = head.data; head = head.next; size--; if (head == null) { tail = null; } return removedData; } public int removeTail() { int removedData = tail.data; if (head == tail) { head = null; tail = null; } else { Node current = head; while (current.next != tail) { current = current.next; } tail = current; tail.next = null; } size--; return removedData; } @Override public String toString() { StringBuilder builder = new StringBuilder(); Node current = head; while (current != null) { builder.append(current.data); if (current.next != null) { builder.append(" -> "); } current = current.next; } return builder.toString(); } private class Node { public Node next; public int data; public Node(int data) { this.data = data; } } }.

Rewrite this code so it can use a generic type instead of integers. .pdf

alphaagenciesindia

I need help implementing a Stack with this java programming assignment: Given a doubly linked list (code provided below) implement a Stack. You must use the doubly link list class and utilize it as an object in your implementation of the stack. A Stack is a Last in First Out (LiFO) structure which translates to the processes of outputting the last element which was inputted in the collection. The Stack is based on the process of putting things on top of one another and taking the item on top (think of a stack of papers). Operations to implement: push (E): Add an element to the start of the sequence pop: Remove an element from the start of the sequence Peek: Return the first element of the sequence without removing it atIndex(x): Return the element at the given index (x) Or throw an exception if it is out of bound (if you can control the user input then do that instead) Size: Return the size of the Stack isEmpty: Boolean, returns true if the Stack is empty Empty: Empty the Stack Code Part 1: public class DoublyLinkedList{ private DNode head; private DNode tail; private int size; public DoublyLinkedList(){ // construct an empty list this.tail = new DNode (null, null, this.head); this.head = new DNode (null, this.tail, null); this.size = 0; } public DoublyLinkedList(DNode next){ // constructs a list // out of a single node this.tail = new DNode (null, null, next); this.head = new DNode (null, next, null); next.changeNext(this.tail); next.changePrev(this.head); this.size = 1; } public DoublyLinkedList(Object [] objectArray){ // construct a list out of // an array this.tail = new DNode (null, null, this.head); this.head = new DNode (null, this.tail, null); DNode temp = this.head; for (Object e : objectArray) { //Anonomus function new DNode (e, temp.getNext(),temp).insertBetweenNodes(temp, temp.getNext()); temp = temp.getNext(); this.size += 1; } } public void addToFrontofList(Object toAdd){ // Appends the begining // of the list DNode temp = new DNode (toAdd, this.head.getNext(), this.head); this.head.getNext().changePrev(temp); this.head.changeNext(temp); this.size += 1; } public void addToendofList (Object toAdd) // appends the end of the list // with a node { DNode temp = new DNode (toAdd, this.tail, this.tail.getPrev()); this.tail.getPrev().changeNext(temp); this.tail.changePrev(temp); this.size += 1; } public void insertAfterNode(DNode current, Object input)// Inserts a new // a new node after // current node { current.insertAfterNode(input); this.size += 1; } public int getSize() // returns the size of the list { return this.size; } public String toString() { String result = \"\"; for (DNode temp = this.head.getNext(); temp.hasNext(); temp = temp.getNext()) { result += temp.getValue(); result += \" -> \"; } result += \"End of list\"; return result; } } and code part2: public class DNode{ private Object e; // place holder for the type of object the //collection is storing private DNode next; // reference to the next node in the sequence // of.

I need help implementing a Stack with this java programming assignme.pdf

sauravmanwanicp

NumberList.java (implements the linked list) public class NumberList{ Node first; Node last; public NumberList(){ first = null; last = null; } public NumberList(Node node){ this.first = node; this.last = node; } public boolean isEmpty(){ return first == null; } public void setLast(Node node){ this.last = node; } public void insert(Node node){ if (first==null){ this.first = node; this.last = node; } else{ node.previous = this.last; node.previous.next = node; node.next = null; this.last = node; } } public boolean inList(String num){ Node l = first; while (l.next != null){ if (l.number.equals(num)){ return true; } else{ l = l.next; } } return false; } public void printList(){ Node l = first; while(l.next!=null){ System.out.print(l.number+\" \"); l = l.next; } System.out.println(); } } Node.java (implements a single node in the linked list; stores number and pointers) public class Node{ String number; Node previous; Node next; public Node(String num){ number = num; previous = null; next = null; } public Node(String num, Node p, Node n){ number = num; previous = p; next = n; } } Main.java (contains the main method and the helper methods to solve the questions given) import java.util.Scanner; import java.util.List; import java.util.ArrayList; public class Main{ static boolean checkHappiness(String num){ Node current = new Node(num, null, null); NumberList numberList = new NumberList(current); int len = num.length(); int resultant = 0; for (int i=0; i happyNumbersfrom1to10000(){ ArrayList numbers = new ArrayList(); for (int j=0; j<10000; j++){ if (checkHappiness(String.valueOf(j+1))){ numbers.add(String.valueOf(j+1)); } } return numbers; } static void happyNumbersfrom9001to10000(){ for (int j=9001; j<=10000; j++){ //System.out.println(j); if (checkHappiness(String.valueOf(j))){ System.out.println(String.valueOf(j)); } } } static String getLargeHappyNumber(){ for (long i=10000000000000000000L; i<1000000000000000000000L; i++){ if (checkHappiness(String.valueOf(i))){ return String.valueOf(i); } return \"-1\"; } } static String getLargeUnhappyNumber(){ for (long i=10000000000000000000L; i<1000000000000000000000L; i++){ if (!checkHappiness(String.valueOf(i))){ return String.valueOf(i); } return \"-1\"; } } public static void main(String[] args){ happyNumbersfrom9001to10000(); System.out.println(happyNumbersfrom1to10000()); } } Solution NumberList.java (implements the linked list) public class NumberList{ Node first; Node last; public NumberList(){ first = null; last = null; } public NumberList(Node node){ this.first = node; this.last = node; } public boolean isEmpty(){ return first == null; } public void setLast(Node node){ this.last = node; } public void insert(Node node){ if (first==null){ this.first = node; this.last = node; } else{ node.previous = this.last; node.previous.next = node; node.next = null; this.last = node; } } public boolean inList(String num){ Node l = first; while (l.next != null){ if (l.number.equals(num)){ return true; } else{ l = l.

NumberList.java (implements the linked list)public class NumberLis.pdf

anjanacottonmills

Please refer this solution. This is working file for Integers Header file :- ----------------------------------- #ifndef LINKEDLIST_H #define LINKEDLIST_H struct node{ void * data; node * next; }; class LinkedList { private: node* head ; int size; public: LinkedList(); //method to create a node node * create(void* data); //method to append void append(node * item); //method to prepend void prepend(node * item); //insert in ascending order void insertAscend(node * item); //insert in ascending order void insertDescend(node * item); //display all nodes void display(); //free the list void freeUp(); }; #endif // LINKEDLIST_H Source file :- ---------------------------------- #include \"linkedlist.h\" #include #include #include LinkedList::LinkedList() { //head = (node *)malloc(sizeof(node)); size = 0; head = NULL; } //method to create a node node * LinkedList::create(void* data){ node * newNode = (node *)malloc(sizeof(node)); newNode->data = malloc(sizeof(data)); memcpy(newNode->data,data,sizeof(data)); newNode->next = NULL; return newNode; } //method to append void LinkedList::append(node * item){ if(head == NULL){ head = item; size++; return; } node* current; current = head; while (current->next!=NULL ) { current = current->next; } current->next = item ; size++; } //method to prepend void LinkedList::prepend(node * item){ if(head == NULL){ head = item; size++; return; } item->next = head; head = item; size++; } //insert in ascending order void LinkedList::insertAscend(node * item){ if(head == NULL){ head = item; size++; return; } node* current; current = head; node * prev = NULL; bool found = false; while (current !=NULL){ int *current_data = static_cast(current->data); int *item_data = static_cast(item->data); if(*item_data < *current_data){ if(prev == NULL){ item->next = current; if(current == head){ head = item; } } else{ prev->next = item; item->next = current; } found = true; break; } prev = current; current = current->next; } if(!found){ prev->next = item; } size++; } //insert in Descending order void LinkedList::insertDescend(node * item){ if(head == NULL){ head = item; size++; return; } node* current; current = head; node * prev = NULL; bool found = false; while (current !=NULL){ int *current_data = static_cast(current->data); int *item_data = static_cast(item->data); if(*item_data > *current_data){ if(prev == NULL){ item->next = current; if(current == head){ head = item; } } else{ prev->next = item; item->next = current; } found = true; break; } prev = current; current = current->next; } if(!found){ prev->next = item; } size++; } //display all nodes void LinkedList::display(){ int idx = 0; node* current; current = head; while (current != NULL ){ idx++; int *data = static_cast(current->data); printf(\"data for item ::%dis :: %d\ \",idx,*data); current = current->next; } } //free the list void LinkedList::freeUp(){ node* current; current = head; while (current->next!=NULL ){ head = current->next; delete current; current = head; } } Main f.

Please refer this solution. This is working file for IntegersHeade.pdf

sooryasalini

Lab-2.2 717822E504.pdf

21E135MAHIESHWARJ

How to delete one specific node in linked list in C? Thanks Solution #include #include struct node { int data; struct node *next; }; void deleteNode(struct node *head, struct node *n) { if(head == n) { if(head->next == NULL) { printf(\"There is only one node. The list can\'t be made empty \"); return; } head->data = head->next->data; n = head->next; head->next = head->next->next; free(n); return; } struct node *prev = head; while(prev->next != NULL && prev->next != n) prev = prev->next; if(prev->next == NULL) { printf(\"\ Given node is not present in Linked List\"); return; } prev->next = prev->next->next; free(n); return; } void push(struct node **head_ref, int new_data) { struct node *new_node = (struct node *)malloc(sizeof(struct node)); new_node->data = new_data; new_node->next = *head_ref; *head_ref = new_node; } void printList(struct node *head) { while(head!=NULL) { printf(\"%d \",head->data); head=head->next; } printf(\"\ \"); } int main() { struct node *head = NULL; push(&head,3); push(&head,2); push(&head,6); push(&head,5); push(&head,11); push(&head,10); push(&head,15); push(&head,12); printf(\"Given Linked List: \"); printList(head); printf(\"\ Deleting node %d: \", head->next->next->data); deleteNode(head, head->next->next); printf(\"\ Modified Linked List: \"); printList(head); printf(\"\ Deleting first node \"); deleteNode(head, head); printf(\"\ Modified Linked List: \"); printList(head); getchar(); return 0; }.

How to delete one specific node in linked list in CThanksSolu.pdf

footstatus

public class SLL { protected SLLNode head, tail; public SLL() { head = tail = null; } public void addToTail(T e){ SLLNode newNode = new SLLNode(e); if(head == null) head = tail = newNode; else{ tail.next = newNode; tail = tail.next; } } public void addToHead(T e) { SLLNode newNode = new SLLNode(e, head); if(head == null) tail = newNode; head = newNode; } public String toString(){ if (head == null) return "[]"; String out = "["; SLLNode p = head; while (p.next != null){ out += p.info + " "; p = p.next; } out += p.info + "]"; return out; } } public class SLLNode { protected T info; protected SLLNode next; public SLLNode() { this(null, null); } public SLLNode(T e) { this(e, null); } public SLLNode(T e, SLLNode ptr) { info = e; next = ptr; } } public class SortedSLL> extends SLL{ public void insert(T e){ } public void merge(SortedSLL list){ } } public class SortedSLL T extends Comparable T extends SLLT{ public void insert (T e) \{ \} public void merge(SortedSLL T list) \{ \} public class SortedSLL T extends Comparable T extends SLLT{ public void insert ( T e) \{ \} public void merge(SortedSLL T list) \{ \} \} ublic class SLLT{ protected SLLNodeT head, tail; public SLL() \{ head = tail = null; \} public void addToTail( T e) \{ SLLNode newNode = new SLLNodeT(e); if ( head == null) head = tail = newNode; else\{ tail. next = newNode; tail = tail. next; \} \} public void addToHead( T e) \{ SLLNode T newNode = new SLLNodeT(e, head ); if (head == null) tail = newNode; head = newNode; \} public string tostring()\{ if (head == null) return "[]"; String out = "["; SLLNode Tp= head; while (p.next != null) \{ out +=p.info +" "; p=p next; \} out += p.info + "]"; return out; \} ublic class SLLNode T{ protected T info; protected SLLNode T next; public SLLNode() \{ this(null, null); \} public SLLNode( T e) \{ this (e, null); \} public SLLNode( T e, SLLNode T ptr ){ info =e; next =ptr; \} Write a subclass of SLL named SortedSLL that represents a sorted SinglyLinkedList (sorted in nondecending order). The class should contain the following methods: 1- [40 Points] void insert ( T e) that inserts an SLLNode in its correct position so that the resulting list remains sorted. Make sure to consider special cases such as: - The list is empty. - The list has one element. - The inserted element is smaller than the head, or larger than the tail.. 2- [60 Points] void merge(SortedSLL T list) that merges the calling list with the argument list. Note that this can be done by calling the insert method for each element in list, but this is highly ineffiecient, answer the following question: Q2.1: What is the complexity of this approach? Explain. [10 Points] Instead, you should come up with a solution that traverse both lists just one time. Furthermore, the argument list should be empty after the merge is completed. Q2.2: What is the complexity of this approach? Explain. [10 Points] Hint: Make sure the class SortedSLL accepts types T that is comparable. You can do this by writing .

public class SLLT { protected SLLNodeT head, tail; pub.pdf

clarityvision

C program to insert a node in doubly linked list

Sourav Gayen

C# code please Write a program that creates a link list object of 10 characters, then creates a second list object containing a copy of the first list but in reverse order. Solution using System; class LinkedList { private char data; private LinkedList next; public LinkedList() { data = \'c\'; next = null; } public LinkedList(char value) { data = value; next = null; } public LinkedList Append(char value) { LinkedList node = new LinkedList(value); if(this.next == null) { // Easy to handle node.next = null; // already set in constructor this.next = node; } else { // Insert in the middle LinkedList temp = this.next; node.next = temp; this.next = node; } return node; } public void Display(LinkedList node) { if(node == null) node = this; System.Console.WriteLine(\"\ \ LinkedList:\ \ \"); while(node != null) { System.Console.Write(node.data+\" -> \"); node = node.next; } System.Console.Write(\"\ \"); } public LinkedList Reverse_with_copy(LinkedList head) { LinkedList p = head; LinkedList newhead = null; while(true) { if(p == null) return newhead; LinkedList newnode = new LinkedList(p.data); newnode.next = newhead; newhead = newnode; p = p.next; } } } class Program { static void Main(string[] args) { LinkedList head = new LinkedList(\'a\'); LinkedList p = head.Append(\'c\'); p = p.Append(\'e\'); p = p.Append(\'h\'); p = p.Append(\'b\'); p = p.Append(\'d\'); p = p.Append(\'f\'); p = p.Append(\'g\'); head.Display(null); LinkedList newhead = head.Reverse_with_copy(head); newhead.Display(null); } } /* sample output */.

C# code pleaseWrite a program that creates a link list object of 1.pdf

duttakajal70

Here is the editable code: Solution import java.util.NoSuchElementException; public class DoublyLinkedListImpl { private Node head; private Node tail; private int size; public DoublyLinkedListImpl() { size = 0; } private class Node { E element; Node next; Node prev; public Node(E element, Node next, Node prev) { this.element = element; this.next = next; this.prev = prev; } } public int size() { return size; } public boolean isEmpty() { return size == 0; } public void addFirst(E element) { Node tmp = new Node(element, head, null); if(head != null ) {head.prev = tmp;} head = tmp; if(tail == null) { tail = tmp;} size++; System.out.println(\"adding: \"+element); } /** * adds element at the end of the linked list * @param element */ public void addLast(E element) { Node tmp = new Node(element, null, tail); if(tail != null) {tail.next = tmp;} tail = tmp; if(head == null) { head = tmp;} size++; System.out.println(\"adding: \"+element); } public void iterateForward(){ System.out.println(\"iterating forward..\"); Node tmp = head; while(tmp != null){ System.out.println(tmp.element); tmp = tmp.next; } } /** * this method walks backward through the linked list */ public void iterateBackward(){ System.out.println(\"iterating backword..\"); Node tmp = tail; while(tmp != null){ System.out.println(tmp.element); tmp = tmp.prev; } } public E removeFirst() { if (size == 0) throw new NoSuchElementException(); Node tmp = head; head = head.next; head.prev = null; size--; System.out.println(\"deleted: \"+tmp.element); return tmp.element; } public E removeLast() { if (size == 0) throw new NoSuchElementException(); Node tmp = tail; tail = tail.prev; tail.next = null; size--; System.out.println(\"deleted: \"+tmp.element); return tmp.element; } public static void main(String a[]){ DoublyLinkedListImpl dll = new DoublyLinkedListImpl(); dll.addFirst(10); dll.addFirst(34); dll.addLast(56); dll.addLast(364); dll.iterateForward(); dll.removeFirst(); dll.removeLast(); dll.iterateBackward(); } } import java.util.Scanner; /* Class Node */ class Node { protected int data; protected Node next, prev; /* Constructor */ public Node() { next = null; prev = null; data = 0; } /* Constructor */ public Node(int d, Node n, Node p) { data = d; next = n; prev = p; } /* Function to set link to next node */ public void setLinkNext(Node n) { next = n; } /* Function to set link to previous node */ public void setLinkPrev(Node p) { prev = p; } /* Funtion to get link to next node */ public Node getLinkNext() { return next; } /* Function to get link to previous node */ public Node getLinkPrev() { return prev; } /* Function to set data to node */ public void setData(int d) { data = d; } /* Function to get data from node */ public int getData() { return data; } } /* Class linkedList */ class linkedList { protected Node start; protected Node end ; public int size; /* Constructor */ public linkedList() { start = null; end = null; size = 0; } /* Function to check if list is empty */ public boolean isE.

Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf

arrowmobile

import java-util-Iterator- import java-util-NoSuchElementException- im.pdf

Stewart29UReesa

could you implement this function please, im having issues with it. void makeList (const ListNode::value_type [],const size_t& count) class ListNode { public: typedef int value_type; ListNode (value_type d = value_type(), ListNode* n = NULL) { datum = d; next = n; } //Assessor value_type getDatum () const { return datum; } ListNode const* getNext () const { return next; } //Mutator void setDatum (const value_type& d) {datum = d; } ListNode* getNext () { return next; } void setNext (ListNode* new_link) {next = new_link; } private: value_type datum; ListNode* next; }; class LinkedList { public: LinkedList (); virtual ~LinkedList (); void insertItem (ListNode::value_type); void makeList (const ListNode::value_type [],const size_t& count); void deleteList (); //The following friend function is implemented in lablinklist.cpp friend std::ostream& operator<<(std::ostream&, const LinkedList&); private: ListNode* head; }; This is the pseudocode, but i still have a hard time undertanding it. Creating a List (makeList(const ListNode::value_type [],const size_t& count)) This function receives an array in the order that we want to add it to the linkedlist. Index 0 will be the head node, index n will be the last node. First, create a node initialized with a data value and a NULL pointer. Set the \"head\" to point to the first node. Set up a current-pointer to the first node (or \"head\"). Get a data value for the next node. While more nodes to add { Create a new node initialized with the data value and a NULL pointer. Set the current-pointer link member (\"next\") to the new node. Set the current-pointer to point to the new node. Get a data value for the next node. } Thanks. Solution //linkedList.h #ifndef LINKEDLIST_H #define LINKEDLIST_H #include #include class ListNode { public: typedef int value_type; ListNode(value_type d = value_type(), ListNode* n = NULL) { datum = d; next = n; } //Assessor value_type getDatum() const { return datum; } ListNode const* getNext() const { return next; } //Mutator void setDatum(const value_type& d) { datum = d; } ListNode* getNext() { return next; } void setNext(ListNode* new_link) { next = new_link; } private: value_type datum; ListNode* next; }; class LinkedList { public: LinkedList(); virtual ~LinkedList(); void insertItem(ListNode::value_type); void makeList(const ListNode::value_type[], const size_t& count); void deleteList(); //The following friend function is implemented in lablinklist.cpp friend std::ostream& operator<<(std::ostream&, const LinkedList&); private: ListNode* head; }; #endif ------------------------------------------------------------- //linkedList.cpp #include \"linkedlist.h\" LinkedList::LinkedList() { head = NULL; } LinkedList::~LinkedList() { ListNode *tmp = head; while (tmp != NULL) { head = head->getNext(); delete tmp; tmp = head; } } void LinkedList::insertItem(ListNode::value_type item) { ListNode *newNode,*cur = head; newNode = new ListNode; newNode->setDatum(item); newNode->setNext(NULL);.

could you implement this function please, im having issues with it..pdf

feroz544

hi i have to write a java program involving link lists. i have a problem with the nodes, as it is posting errors with the nodes. please help me with this problem. thank you. public class LinkLists { /* only need to store a single pointer to the node at the head * of the list. * The pointer is null if the list is empty. * Also record the size of the list. */ protected Node head; /* invariant: size is the number of nodes in the list pointed to by head */ protected int size; /* no-arguments default constructor creates an empty list */ public LinkLists() { head = null; // start with an empty list size = 0; } /* accessor method */ public int size() { return size; } /* value to add to the end of the list */ public void add(T value) { head = addAtEnd(head, value); size++; } /* node of the list to which the value should be added * value to add to the end of the list */ private Node addAtEnd(Node node, T value) { if (node == null) { // special case return new Node(value, null); } else if (node.getNext() == null) { // other special case node.setNext(new Node(value, null)); } else { addAtEnd(node.getNext(), value); } return node; } /* iterative implementation of the same method * value to add to the end of the list */ public void add2(T value) { if (head == null) { head = new Node(value, null); } else { Node node = head; // guaranteed not to be null initially while (node.getNext() != null) { node = node.getNext(); // guaranteed not to be null here } // now, node.getNext() is guaranteed to be null // similar to the second special case in addAtEnd node.setNext(new Node(value, null)); } size++; } public void remove(int position) throws BadItemCountException { if ((position < 1) || (position > size)) { throw new BadItemCountException(\"invalid position \" + position + \", only 1..\" + size + \" available\"); } if (position == 1) { head = head.getNext(); } else { Node node = head; for (int i = 2; i < position; i++) { node = node.getNext(); } node.setNext(node.getNext().getNext()); } size--; // one less item } public String toString() { return toString(head); } private String toString(Node node) { if (node == null) { return \"\"; } else { return node.getValue() + \"\ \" + toString(node.getNext()); } } public static void main(String[] args) { /* create two empty lists, make sure they print out correctly */ LinkLists list1 = new LinkLists(); LinkLists list2 = new LinkLists(); System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\"); System.out.println(\"list1.size() = \" + list1.size() + \", list2.size() = \" + list2.size()); /* insert some items, keep checking */ list1.add(\"hello\"); list1.add(\"world\"); list2.add(\"foo\"); list2.add(\"bar\"); list2.add(\"baz\"); System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\"); System.out.println(\"list1.size() = \" + list1.size() + \", list2.size() = \" + list2.size()); /* remove an item at an invalid position */ boolean caught = false; try { list2.remove(4); } catch .

hi i have to write a java program involving link lists. i have a pro.pdf

archgeetsenterprises

this is business analytics question. (using gurobi) The days-off scheduling problem must be solved routinely by businesses that operate 6 or 7 days a week. Examples include hospitals, airlines, municipal transportation companies, and the postal service. The most common example is the (5,7)-cyclic staffing problem. The objective of it is to minimize the cost of assigning workers to a 7-day cyclic schedule so that 1) Sufficient workers are available every day. 2) Each person works 5 consecutive days and is idle to the remaining 2 days. Here is the table showing the cost of having an employee for each day and the number of employees required for each day. For example, the pattern that one works from Sunday to Thursday costs 90+604=330. Formulate and solve an integer programming problem to represent this problem. How many employees work Monday-Friday?.

This is to test a balanced tree. I need help testing an unbalanced t.pdf

akaluza07

Similar to fix the error - class Node{ int data- Node next-.pdf (20)

coding in C- Create a function called reverseList that takes the head.docx

Help I keep getting the same error when running a code. Below is the.pdf

137 Lab-2.2.pdf

Linked Stack program.docx

Data structures cs301 power point slides lecture 03

Draw memory map of this link list code and add insert at last ( java)-.pdf

Rewrite this code so it can use a generic type instead of integers. .pdf

I need help implementing a Stack with this java programming assignme.pdf

NumberList.java (implements the linked list)public class NumberLis.pdf

Please refer this solution. This is working file for IntegersHeade.pdf

Lab-2.2 717822E504.pdf

How to delete one specific node in linked list in CThanksSolu.pdf

public class SLLT { protected SLLNodeT head, tail; pub.pdf

C program to insert a node in doubly linked list

C# code pleaseWrite a program that creates a link list object of 1.pdf

Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf

import java-util-Iterator- import java-util-NoSuchElementException- im.pdf

could you implement this function please, im having issues with it..pdf

hi i have to write a java program involving link lists. i have a pro.pdf

This is to test a balanced tree. I need help testing an unbalanced t.pdf

More from AKVIGFOEU

First explain how zygotic induction of lambda phage lysis occurs during bacterial conjugation (use a drawing if you want too, take picture to upload). Second, compare this form of induction to ultraviolet radiation (UV) exposure. Make sure you recall the molecules or pathways involved. Key terms: repressor (R), immunity, Iysogeny, conjugation, lytic, RecA. Finally, explain how zygotic induction provides key experimental evidence about how lambda provides immunity and lysogenic fate upon infection..

First explain how zygotic induction of lambda phage lysis occurs durin.pdf

fix the error - class Node{ int data- Node next-.pdf

Recommended

Recommended

More Related Content

Similar to fix the error - class Node{ int data- Node next-.pdf

Similar to fix the error - class Node{ int data- Node next-.pdf (20)

More from AKVIGFOEU

More from AKVIGFOEU (20)

Recently uploaded

Recently uploaded (20)

fix the error - class Node{ int data- Node next-.pdf