Added File Structure and Redirected Links

Author: Varun-Patkar

Algorithm.md renamed to Comprehensive_Guides/Algorithm.md

@@ -4,7 +4,7 @@
 
 An array is a structure of fixed-size, which can hold items of the same data type. It can be an array of integers, an array of floating-point numbers, an array of strings or even an array of arrays (such as 2-dimensional arrays). Arrays are indexed, meaning that random access is possible.
 
-<img src="Arrays.png" alt="Arrays Image">
+<img src="../Images/Arrays.png" alt="Arrays Image">
 
 ## Array Operations
 

Arrays.md renamed to Comprehensive_Guides/Arrays.md

@@ -14,7 +14,7 @@ In direct accessing, a value with key k is stored in the slot k. Using the hash
 - k: Key of which the hash value should be determined
 - m: Size of the hash table (number of slots available). A prime value that is not close to an exact power of 2 is a good choice for m.
 
-<img src="HashTable.png" alt="Hash Table Image">
+<img src="../Images/HashTable.png" alt="Hash Table Image">
 
 Consider the hash function h(k) = k % 20, where the size of the hash table is 20. Given a set of keys, we want to calculate the hash value of each to determine the index where it should go in the hash table. Consider we have the following keys, the hash and the hash table index.
 

Graph.md renamed to Comprehensive_Guides/Graph.md

@@ -5,8 +5,8 @@
 A Heap is a special case of a binary tree where the parent nodes are compared to their children with their values and are arranged accordingly.
 Let us see how we can represent heaps. Heaps can be represented using trees as well as arrays. Figures 7 and 8 show how we can represent a binary heap using a binary tree and an array.
 
-<img src="Heap 1.png" alt="Heap Image 1">
-<img src="Heap 2.png" alt="Heap Image 2">  
+<img src="../Images/Heap 1.png" alt="Heap Image 1">
+<img src="../Images/Heap 2.png" alt="Heap Image 2">  
 
 ## Types of Heaps
 

HashTable.md renamed to Comprehensive_Guides/HashTable.md

@@ -6,7 +6,7 @@ Linked list elements are not stored at contiguous location; the elements are lin
 
 Each node of a list is made up of two items - the data and a reference to the next node. The last node has a reference to null. The entry point into a linked list is called the head of the list. It should be noted that head is not a separate node, but the reference to the first node. If the list is empty then the head is a null reference.
 
-<img src="LinkedList.png" alt="Linked List Image">
+<img src="../Images/LinkedList.png" alt="Linked List Image">
 
 ## Types of Linked Lists
 

Heap.md renamed to Comprehensive_Guides/Heap.md

@@ -4,7 +4,7 @@
 
 A Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO). A good example of a queue is any queue of consumers for a resource where the consumer that came first is served first. The difference between stacks and queues is in removing. In a stack we remove the item the most recently added; in a queue, we remove the item the least recently added.
 
-<img src="Queue.png" alt="Queues Image" />
+<img src="../Images/Queue.png" alt="Queues Image" />
 
 ## Queue Implementations
 

LinkedList.md renamed to Comprehensive_Guides/LinkedList.md

@@ -6,7 +6,7 @@ Stack is a linear data structure which follows a particular order in which the o
 
 There are many real-life examples of a stack. Consider an example of plates stacked over one another in the canteen. The plate which is at the top is the first one to be removed, i.e. the plate which has been placed at the bottommost position remains in the stack for the longest period of time. So, it can be simply seen to follow LIFO(Last In First Out)/FILO(First In Last Out) order.
 
-<img src="Stack.png" alt="Stack Image">
+<img src="../Images/Stack.png" alt="Stack Image">
 
 ## Stack Implementations
 

Queue.md renamed to Comprehensive_Guides/Queue.md

@@ -1,7 +1,7 @@
 
 # ⚡ Data Structures & Algorithms - A Comprehensive Guide
 
-<img src="Banner.jpeg" alt="Banner Image">
+<img src="Images/Banner.jpeg" alt="Banner Image">
 
 <p align="center">
 <b>A Comprehensive Guide on Data Structures & Algorithms<b>
@@ -15,14 +15,14 @@
 ---
 ### <a id="Traditional Method">Traditional Method</a>
 *The solid easy route to go down the data structures and algorithms hill, risk free and widely used, follow through:*
-  1. [Arrays](Arrays.md)
-  2. [Linked List](LinkedList.md)
-  3. [Stacks](Stack.md)
-  4. [Queues](Queue.md)
-  5. [Hash Tables](HashTable.md)
-  6. [Trees](Tree.md)
-  7. [Heaps](Heap.md)
-  8. [Graphs](Graph.md)
+  1. [Arrays](Comprehensive_Guides/Arrays.md)
+  2. [Linked List](Comprehensive_Guides/LinkedList.md)
+  3. [Stacks](Comprehensive_Guides/Stack.md)
+  4. [Queues](Comprehensive_Guides/Queue.md)
+  5. [Hash Tables](Comprehensive_Guides/HashTable.md)
+  6. [Trees](Comprehensive_Guides/Tree.md)
+  7. [Heaps](Comprehensive_Guides/Heap.md)
+  8. [Graphs](Comprehensive_Guides/Graph.md)
 
 [Also Check Out some Popular Algorithms And Practice Problems](Algorithm.md)
 <br>