Add Header Comment

code/data_structures/Linked List/SinglyLinkedList.java

@@ -1,3 +1,5 @@
+/* Part of Cosmos by OpenGenus Foundation */
+
 class SinglyLinkedList{
 
 	private Node head;

code/data_structures/Linked List/singlylinklist.js

@@ -1,3 +1,5 @@
+/* Part of Cosmos by OpenGenus Foundation */
+
 /* SinglyLinkedList!!
 * A linked list is implar to an array, it hold values.
 * However, links in a linked list do not have indexes. With

code/data_structures/Queue/Queues.java

@@ -1,3 +1,5 @@
+/* Part of Cosmos by OpenGenus Foundation */
+
 class Queue{
 	private int maxSize;
 	private int[] queueArray;

code/data_structures/Stack/Stack.js

@@ -1,3 +1,5 @@
+/* Part of Cosmos by OpenGenus Foundation */
+
 /* Stack!!
 * A stack is exactly what it sounds like. An element gets added to the top of
 * the stack and only the element on the top may be removed. This is an example

code/data_structures/Stack/Stacks.java

@@ -1,3 +1,5 @@
+/* Part of Cosmos by OpenGenus Foundation */
+
 import java.util.ArrayList;
 class Stack{
 	private int maxSize;

code/data_structures/Tree/Binary Search Tree.js

@@ -1,3 +1,5 @@
+/* Part of Cosmos by OpenGenus Foundation */
+
 /*Binary Search Tree!!
 *
 * Nodes that will go on the Binary Tree.

code/data_structures/Tree/BinaryTree.java

@@ -1,3 +1,5 @@
+/* Part of Cosmos by OpenGenus Foundation */
+
 class Node{
 	public int data;
 	public Node left;