Answered: What can I do to make this code…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

What can I do to make this code correct? public class LINKEDLIESTD { class Node{ int data; Node previous; Node next; public Node(int data) { this.data = data; } } Node head, tail = null; public void addNode(int data) { Node newNode = new Node(data); if(head == null) { head = tail = newNode; head.previous = null; tail.next = null; } else { tail.next = newNode; newNode.previous = tail; tail = newNode; tail.next = null; } } public void display() { Node current = head; if(head == null) { System.out.println("list is empty"); return; } System.out.println("Nodes of doubly linked list: "); while(current != null) { System.out.print(current.data + " "); current = current.next; } } public void addBegining(int d) { Node n=new Node(d); if(head==null) { head=n; }else { n.next=head; head=n; } } public void addEnd(int d) { if(head==null) { head=new Node(d); }else { Node tmp=head; while(tmp.next!=null) tmp=tmp.next; tmp.next=new Node(d); } } public String toString() { Node tmp=head; String ans=""; while(tmp!=null) { ans+=tmp.data+"-->"; tmp=tmp.next; } return ans; } public void deleteBegining() { if (head!=null) { head=head.next; } } public void deleteEnd() { Node tmp=head; Node prev = null; while (tmp.next!=null) { prev=tmp; tmp=tmp.next; } prev.next=null; } public boolean contains(int d) { Node tmp=head; while(tmp!=null) { if (tmp.data==d) return true; tmp=tmp.next; } return false; } public void remove(int d) { Node tmp=head; Node prev=null; while(tmp!=null && tmp.data!=d) { prev=tmp; tmp=tmp.next; } if(tmp!=null) prev.next=tmp.next; } public static void main(String[] args) { // TODO Auto-generated method stub LINKEDLIESTD L=new LINKEDLIESTD(); L.addBegining(10); L.addBegining(20); L.addBegining(5); L.addEnd(50); L.addEnd(100); L.addBegining(1); System.out.println(L); L.deleteBegining(); System.out.println(L); L.deleteEnd(); L.addNode(50); L.addNode(60); System.out.println(L); System.out.println(L.contains(10)); System.out.println(L.contains(100)); L.remove(1000); System.out.println(L); } }

Expert Solution