Merge branch 'master' of https://github.com/AlgorithmCrackers/Data-Structures

* 'master' of https://github.com/AlgorithmCrackers/Data-Structures:
  fixes #1 also the useless constructor is removed
  Seperation of java and c implementation

Conflicts:
	Linked-Lists/Java/LinkedList.java

Author: prakashn27

Diff for: Binary-Trees/traversals.c

@@ -73,6 +73,7 @@ void preorder_nonrecursive ( struct node *tree ) {
   }
 }
 // move left, visit, move right
+// see http://imgur.com/9RxHnr8
 void inorder_nonrecursive ( struct node* tree ) {
   /*
   Inorder traversal is harder. We need to walk to the left without losing any

Diff for: Linked-Lists/Makefile renamed to Linked-Lists/C/Makefile

@@ -0,0 +1,65 @@
+/*
+Linked List Implementation
+@author: [email protected]
+*/
+class Node {
+	int data;
+	Node next;
+	Node prev;
+}
+class LinkedList {
+	Node head;
+	Node tail;
+
+	boolean insertFront(int newData) {
+		Node newNode = new Node();
+		newNode.data = newData;
+
+		if(head == null ) {
+			head = newNode;
+			tail = head;
+			return true;
+		}
+		else {
+			Node oldHead = head;
+			head = newNode;
+			head.next = oldHead;
+			oldHead.prev = head;
+			return true;
+		}
+	}
+
+	boolean insertTail(int newData) {
+		Node newNode = new Node();
+		newNode.data = newData;
+		if(head == null ) {
+			head = newNode;
+			tail = head;
+			return true;
+		}
+		else {
+			//Node oldTail = tail;
+			newNode.prev =  tail;
+			tail.next = newNode;
+			tail = newNode;
+			return true;
+		}
+	}
+	int delete(int data) {
+		return 0;
+	}
+	void printList(){
+		Node cur = head;
+		while(cur != null) {
+			System.out.println(cur.data);
+			cur = cur.next;
+		}
+	}
+	public static void main(String[] args) {
+		LinkedList ll = new LinkedList();
+		ll.insertFront(30);
+		ll.insertFront(20);
+		ll.insertFront(10);
+		ll.printList();
+	}
+}