Merge pull request matthewsamuel95#792 from aneuhold/aneuhold-branch1

Added Java singlylinkedlist implementation

Author: matthewsamuel95

Data Structures/SinglyLinkedList/Deletion_By_Key.c renamed to Data Structures/SinglyLinkedList/C/Deletion_By_Key.c

@@ -0,0 +1,11 @@
+
+public class Driver {
+	public static void main(String[] args) {
+		SinglyLinkedList list = new SinglyLinkedList();
+		list.add("Test");
+		list.add("Test 2");
+		list.add(25);
+		list.add(27);
+		System.out.println(list);
+	}
+}

Data Structures/SinglyLinkedList/Deletion_By_Position.c renamed to Data Structures/SinglyLinkedList/C/Deletion_By_Position.c

@@ -0,0 +1,31 @@
+
+public class Node {
+	private Object content;
+	Node nextNode;
+	
+	public Node() {
+		content = null;
+		nextNode = null;
+	}
+	
+	public Node(Object content) {
+		this.content = content;
+		nextNode = null;
+	}
+	
+	public Object getContent() {
+		return content;
+	}
+	
+	public Node getNextNode() {
+		return nextNode;
+	}
+	
+	public void setNextNode(Node nextNode) {
+		this.nextNode = nextNode;
+	}
+	
+	public boolean hasNextNode() {
+		return nextNode != null;
+	}
+}

Data Structures/SinglyLinkedList/Deletion_Every_Alternate_Node.c renamed to Data Structures/SinglyLinkedList/C/Deletion_Every_Alternate_Node.c

@@ -0,0 +1,41 @@
+
+/**
+ * A generic singly linked list implementation that takes any kind of object.
+ */
+public class SinglyLinkedList {
+	Node head;
+	
+	public SinglyLinkedList() {
+		head = null;
+	}
+	
+	public void add(Object elementContent) {
+		if (head != null) {
+			Node temp = new Node(elementContent);
+			temp.setNextNode(head);
+			head = temp;
+		} else {
+			head = new Node(elementContent);
+		}
+	}
+	
+	// TODO: Needs node deletion method or some way of doing that
+	
+	public Node getHeadNode() {
+		return head;
+	}
+	
+	@Override
+	public String toString() {
+		String result = "";
+		if (head != null) {
+			Node currentNode = head;
+			result += currentNode.getContent();
+			while (currentNode.hasNextNode()) {
+				currentNode = currentNode.getNextNode();
+				result += ", " + currentNode.getContent();
+			}
+		}
+		return result;
+	}
+}