Algorithm Pseudocodes

Question 1

Singly Linked List Node Class

Answer 1

public class SinglyLinkedList{private static Class Node{private E element;private Node next;public Node (E e, Node n){element = e;next = n;}public E getElement(){return element;}public Node getNext(){return next;}public void setNext(Node n){next = n;}}}

Question 2

Singly Linked List removeFirst()

Answer 2

public E removeFirst(){if(isEmpty()) return null;E answer = head.getElement();head = head.getNext();size–;if (size == 0)tail = null;return answer;}

Question 3

Doubly Linked List addInBetween() method

Answer 3

public void addInBetween(String data, Node node){ Node newNode = new Node(data, node.next, node); node.setNext(newNode); newNode.getNext().setPrev(newNode); }

Question 4

Doubly Linked List removeFirst() method

Answer 4

public Node removeFirst(){ Node node = head.getNext(); head.setNext(node.getNext()); node.getNext().setPrev(node.getPrev()); size–; return node; }

Question 5

Doubly Linked List removeLast() method

Answer 5

public Node removeLast(){ Node node = tail.getPrev(); tail.setPrev(node.getPrev()); node.getPrev().setNext(node.getNext()); size–; return node; }

Question 6

Doubly Linked List toArrayFromFirst() method

Answer 6

public String[] toArrayFromFirst(){ String[] nodeArray = new String[size]; Node position = head.getNext(); for(int i = 0; i < size; i++){ nodeArray[i] = position.getData(); position = position.getNext(); } return nodeArray; }

Question 7

Doubly Linked List toArrayFromLast() method

Answer 7

public String[] toArrayFromLast(){ String[] nodeArray = new String[size]; Node position = tail.getPrev(); for (int i = 0; i < size; i++){ nodeArray[i] = position.getData(); position = position.getPrev(); } return nodeArray; }

Question 8

Doubly Linked List deepClone() method

Answer 8

public DoublyLinkedList deepClone(){ DoublyLinkedList List = new DoublyLinkedList(); Node position = head.getNext(); for(int i = 0; i < size(); i++){ List.addLast(position.getData()); position = position.getNext(); } return List;