Using the circular doubly linked list below, give the expression corresponding e

Question

Using the circular doubly linked list below, give the expression corresponding each of the following descriptions. For example, the expression for the info value of node 1, referenced from reference A, would be A.getlnfo(). The Info value of node 1, referenced from reference C The info value of node 2, referenced from reference B The link value of node 2, referenced from reference A The link value of node 4, referenced from reference C Node 1, referenced from reference B The back value of node 4, referenced from reference C The back value of node 1, referenced from reference A

Explanation / Answer

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 { 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 isEmpty() { return start == null; } /* Function to get size of list */ public int getSize() { return size; } /* Function to insert element at begining */ public void insertAtStart(int val) { Node nptr = new Node(val, null, null); if (start == null) { nptr.setLinkNext(nptr); nptr.setLinkPrev(nptr); start = nptr; end = start; } else { nptr.setLinkPrev(end); end.setLinkNext(nptr); start.setLinkPrev(nptr); nptr.setLinkNext(start); start = nptr; } size++ ; } /*Function to insert element at end */ public void insertAtEnd(int val) { Node nptr = new Node(val, null, null); if (start == null) { nptr.setLinkNext(nptr); nptr.setLinkPrev(nptr); start = nptr; end = start; } else { nptr.setLinkPrev(end); end.setLinkNext(nptr); start.setLinkPrev(nptr); nptr.setLinkNext(start); end = nptr; } size++; } /* Function to insert element at position */ public void insertAtPos(int val , int pos) { Node nptr = new Node(val, null, null); if (pos == 1) { insertAtStart(val); return; } Node ptr = start; for (int i = 2; i list.getSize() ) System.out.println("Invalid position "); else list.insertAtPos(num, pos); break; case 4 : System.out.println("Enter position"); int p = scan.nextInt() ; if (p < 1 || p > list.getSize() ) System.out.println("Invalid position "); else list.deleteAtPos(p); break; case 5 : System.out.println("Empty status = "+ list.isEmpty()); break; case 6 : System.out.println("Size = "+ list.getSize() +" "); break; default : System.out.println("Wrong Entry "); break; } /* Display List */ list.display(); System.out.println(" Do you want to continue (Type y or n) "); ch = scan.next().charAt(0); } while (ch == 'Y'|| ch == 'y'); } }

Related Questions

Navigate

• Browse (All)
• Browse U
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.