JAVA lists and nodes my answer was : ListNode newNode = new ListNode(3); newNode.next = head;...

Question

Question

JAVA lists and nodes

my answer was :

ListNode newNode = new ListNode(3);

newNode.next = head;

head = newNode;

it is incorrect. what could it be?

linkedNodes 11 > <linkedNodes 9 Main Page -- Problems - Solve a Problem OBJP5 Self-Check 16.10: linkedNodes 10 Language/Type:

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1


ListNode newNode = new ListNode(3);
newNode.next = list;
list = newNode;


There is no node named head.
Name of the head is list as it is in the given diagram

Note: Please comment below if you have any doubts. upuote the solution if it helped. Thanks!

Add a comment

Answer 2

Similar Homework Help Questions

O indexOf Language/Type: Related Links: Author: Java implementing Linked Lists LinkedIntList LinkedIntList.java Marty Stepp Write a...

O indexOf Language/Type: Related Links: Author: Java implementing Linked Lists LinkedIntList LinkedIntList.java Marty Stepp Write a method indexOf that accepts a value as a parameter and returns the index in the list of the first occurrence of that value, or -1 if the value is not found in the list. Assume that you are adding this method to the LinkedIntList class as defined below: public class LinkedIntList { private ListNode front; // null for an empty list Type your solution...
#include <iostream> using namespace std; struct ListNode { float value; ListNode *next; }; ...

#include <iostream> using namespace std; struct ListNode { float value; ListNode *next; }; ListNode *head; class LinkedList { public: int insertNode(float num); void deleteNode(float num); void destroyList(); void displayList(); LinkedList(void) {head = NULL;} ~LinkedList(void) {destroyList();} }; int LinkedList::insertNode(float num) { struct ListNode *newNode, *nodePtr = head, *prevNodePtr = NULL; newNode = new ListNode; if(newNode == NULL) { cout << "Error allocating memory for new list member!\n"; return 1; } newNode->value = num; newNode->next = NULL; if(head==NULL) { cout << "List...
could somone please help me to complete this ! public class MyLinkedList<AnyType> { private Node<AnyType> head,...

could somone please help me to complete this ! public class MyLinkedList<AnyType> { private Node<AnyType> head, tail; private int size; public MyLinkedList() { this.head = null; this.tail = null; this.size = 0; } //1.Insert a node at the end of the list public void insert(AnyType data) { Node<AnyType> newNode = new Node(); newNode.data = data; if (head == null) { head = newNode; tail = newNode; head.next = null; tail.next = null; } else { tail.next = newNode; tail =...

if we have following List classes: public class LinkedList<T> { class ListNode { protected T value;...

if we have following List classes: public class LinkedList<T> { class ListNode { protected T value; protected ListNode next; public ListNode(T val, ListNode nxt) { value = val; next = nxt; } public ListNode(T val) { this(val, null); } public ListNode() { this(null, null); } } can you write the folowing methods in java: 1.Write a method for the LinkedList class called int indexOf(T val) which returns the integer index indicating the location of val in the list, or -1...
Hi! Can someone can convert this java code to c++. ASAP thanks I will thumbs up Here's the code: ...

Hi! Can someone can convert this java code to c++. ASAP thanks I will thumbs up Here's the code: package lists; import bookdata.*; public class DoublyLinkedList { int size; //Variable que define el tamano de la lista. Node head, tail; //Nodos que definen el Head y Tail en la lista. //Constructor public DoublyLinkedList(){ this.head = null; this.tail = null; this.size = 0; } //Insert a new book in alphabetic order. public void insert(Book nb){ //Creamos uno nuevo nodo con el...
In C++, for the provided template linked list class create a derived class of it which...

In C++, for the provided template linked list class create a derived class of it which adds the functionality to it to find the high and low value of any given data stored in the list. The derived class must be a template. LinkedList.h #pragma once #include <iostream> using namespace std; template <class T> class ListNode { public: T data; ListNode<T>* next; ListNode(T data) { this->data = data;...

Problem 2: based on java.util.LinkedList class, create MyStack class that should have the methods: push(), pop(),...

Problem 2: based on java.util.LinkedList class, create MyStack class that should have the methods: push(), pop(), peek(), size(), isEmpty(). my linkedlist class is: public class Lab8_problem1 { private Node head, tail; private int size; public Lab8_problem1() { this.head = null; this.tail = null; this.size = 0; } //Insert a node at specifc Location public void insertAt(int value, int index) { Node newNode = new Node(); newNode.data = value; if(head == null){ head = newNode; tail = newNode; head.next...
Codelab question! This is c++. Consider the following code: // Linked Lists: TRAVERSE struct ListNode {...

Codelab question! This is c++. Consider the following code: // Linked Lists: TRAVERSE struct ListNode { int data; struct ListNode *next; }; Assume that a linked list has been created and head points to a sentinel node. A sentinel node is an empty data node in the beginning of the list. It sometimes holds a sentinel value. The use of sentinel nodes is a popular trick to simplify the insert and delete operations. You may also assume that the list...
Using the provided Linked List template, add the following recursive functions and demonstrate them in a...

Using the provided Linked List template, add the following recursive functions and demonstrate them in a separate cpp file. Write a recursive function to print the list in order. Write a recursive function to print the list in reverse order. Write a recursive function to print every other node in the list in order. Write a recursive function to return the number of nodes in the list. Write a Boolean function that implements the recursive version of sequential search. THIS...

C++ Assignment Project 1 - NodeList Building upon the the ListNode/List code I would like you...

C++ Assignment Project 1 - NodeList Building upon the the ListNode/List code I would like you to extend the interface of a list to have these member functions as well. struct ListNode { int element; ListNode *next; } Write a function to concatenate two linked lists. Given lists l1 = (2, 3, 1)and l2 = (4, 5), after return from l1.concatenate(l2)the list l1should be changed to be l1 = (2, 3, 1, 4, 5). Your function should not change l2and...

JAVA lists and nodes my answer was : ListNode newNode = new ListNode(3); newNode.next = head;...

Homework Answers

Add Answer to:
JAVA lists and nodes my answer was : ListNode newNode = new ListNode(3); newNode.next = head;...

Post as a guest

Earn Coins

O indexOf Language/Type: Related Links: Author: Java implementing Linked Lists LinkedIntList LinkedIntList.java Marty Stepp Write a...

#include <iostream> using namespace std; struct ListNode { float value; ListNode *next; }; ...

could somone please help me to complete this ! public class MyLinkedList<AnyType> { private Node<AnyType> head,...

if we have following List classes: public class LinkedList<T> { class ListNode { protected T value;...

Hi! Can someone can convert this java code to c++. ASAP thanks I will thumbs up Here's the code: ...

In C++, for the provided template linked list class create a derived class of it which...

Problem 2: based on java.util.LinkedList class, create MyStack class that should have the methods: push(), pop(),...

Codelab question! This is c++. Consider the following code: // Linked Lists: TRAVERSE struct ListNode {...

Using the provided Linked List template, add the following recursive functions and demonstrate them in a...

C++ Assignment Project 1 - NodeList Building upon the the ListNode/List code I would like you...

JAVA lists and nodes my answer was : ListNode newNode = new ListNode(3); newNode.next = head;...

Homework Answers

Add Answer to: JAVA lists and nodes my answer was : ListNode newNode = new ListNode(3); newNode.next = head;...

Post as a guest

Earn Coins

Add Answer to:
JAVA lists and nodes my answer was : ListNode newNode = new ListNode(3); newNode.next = head;...