standardised READMEs

Author: GauravWalia19

C++/README.md

@@ -12,23 +12,28 @@
 * [2 DIMENSIONAL ARRAY](Data-Structures/ARRAYS/2darrays.cpp)
 * [3 DIMENSIONAL ARRAY](Data-Structures/ARRAYS/3darrays.cpp)
 * [4 DIMENSIONAL ARRAY](Data-Structures/ARRAYS/4darrays.cpp)
-* INBUILT ARRAY CLASSES
+* INBUILT
   * ARRAY CLASS
 * MISC
+  * [HEAPED 1D ARRAY](Data-Structures/HEAPS/1darray.cpp)
+  * [HEAPED 2D ARRAY](Data-Structures/HEAPS/2darray.cpp)
+  * [HEAPED 3D ARRAY](Data-Structures/HEAPS/3darray.cpp)
   * JAGGED ARRAY
 
+#### STRING
+
 #### LISTS
 
-* LINKED-LIST
-  * SINGLE
-    * [SINGLE](Data-Structures/LISTS/LINKED-LIST/SINGLE/Main.cpp)
-  * DOUBLE
-  * CIRCULAR
+* SINGLE
+  * [SINGLE](Data-Structures/LISTS/LINKED-LIST/SINGLE/Main.cpp)
+* DOUBLE
+* CIRCULAR
 * MEMORY EFFICIENT DOUBLE LINKED LIST
 * UNROLLED LINKED LIST
 * SKIP LIST
 * INBUILT LISTS
   * [VECTORS](Data-Structures/LISTS/INBUILT-LISTS/VECTORS/Main.cpp)
+* MISC
 
 #### STACKS
 
@@ -44,11 +49,40 @@
     * [STACK](Data-Structures/STACKS/MISC/TWO-WAY/Tstack.hpp)
     * [USAGE](Data-Structures/STACKS/MISC/TWO-WAY/two-way-stack.cpp)
 
-#### HEAPS
-
-* [1d array](Data-Structures/HEAPS/1darray.cpp)
-* [2d array](Data-Structures/HEAPS/2darray.cpp)
-* [3d array](Data-Structures/HEAPS/3darray.cpp)
+#### QUEUES
+
+* SIMPLE QUEUE
+  * FIXED ARRAY SIMPLE QUEUE
+  * DYNAMIC ARRAY SIMPLE QUEUE
+  * LINKED SIMPLE QUEUE
+* CIRCULAR QUEUE
+  * FIXED ARRAY CIRCULAR QUEUE
+  * LINKED CIRCULAR QUEUE
+* PRIORITY QUEUE
+  * FIXED ARRAY PRIORITY QUEUE
+  * LINKED PRIORITY QUEUE
+  * HEAPED PRIORITY QUEUE
+
+#### HASHTABLE
+
+#### TREES
+
+* BINARY TREE
+* GENERIC TREES
+* THREADED BINARY TREE
+* XOR TREES
+* BINARY SEARCH TREE
+* AVL TREES
+* RED BLACK TREES
+* SPLAY TREES
+* AUGMENTED TREES
+* SCAPEGOAT TREES
+* INTERVAL TREES
+* HEAP TREE
+
+#### GRAPHS
+
+#### BLOCKCHAIN
 
 ### :rocket: DYNAMIC PROGRAMMING
 

C/README.md

@@ -15,8 +15,13 @@
 * [3 DIMENSIONAL ARRAYS](Data-Structures/ARRAYS/3darrays.c)
 * [4 DIMENSIONAL ARRAYS](Data-Structures/ARRAYS/4darrays.c)
 * MISC
+  * [1D ARRAYS USING HEAPS](Data-Structures/HEAPS/dynamicarray.c)
+  * [2D ARRAYS USING HEAPS](Data-Structures/HEAPS/dynamic2d.c)
+  * [3D ARRAYS USING HEAPS](Data-Structures/HEAPS/dynamic3d.c)
   * [JAGGED ARRAYS](Data-Structures/ARRAYS/MISC/jaggedarray.c)
 
+#### STRING
+
 #### LISTS
 
 * LINKED LIST
@@ -28,6 +33,7 @@
 * MEMORY EFFICIENT DOUBLE LINKED LIST
 * UNROLLED LINKED LIST
 * SKIP LIST
+* MISC
 
 #### STACKS
 
@@ -52,6 +58,8 @@
   * DYNAMIC ARRAY
   * LINKED
 
+#### HASHTABLE
+
 #### TREES
 
 * BINARY TREE
@@ -67,11 +75,9 @@
 * INTERVAL TREES
 * HEAP TREE
 
-#### HEAPS
+#### GRAPHS
 
-* [1D ARRAYS USING HEAPS](Data-Structures/HEAPS/dynamicarray.c)
-* [2D ARRAYS USING HEAPS](Data-Structures/HEAPS/dynamic2d.c)
-* [3D ARRAYS USING HEAPS](Data-Structures/HEAPS/dynamic3d.c)
+#### BLOCKCHAIN
 
 ### :rocket: DYNAMIC PROGRAMMING
 

Java/Data-Structures/ARRAYS/arrays.java renamed to Java/Data-Structures/ARRAYS/INBUILT/arrays.java

@@ -12,30 +12,33 @@
 * [two dimensional array](Data-Structures/ARRAYS/twoDarray.java)
 * [three dimensional array](Data-Structures/ARRAYS/threeDarray.java)
 * [four dimensional array](Data-Structures/ARRAYS/fourDarray.java)
+* INBUILT
+  * [ARRAYS CLASS](Data-Structures/ARRAYS/INBUILT/arrays.java)
+* MISC
+  * JAGGED ARRAY
 
 #### STRING
 
 * [implementation with methods](Data-Structures/STRING/Strings.java)
 
 #### LISTS
 
-* LINKED LIST
-  * SINGLE
-    * [Single Linked List](Data-Structures/LISTS/SINGLE/LinkedList.java)
-    * [Single Linked List using object data](Data-Structures/LISTS/Single-Linked-List/singleLinkedList.java)
-  * DOUBLE
-    * [Double Linked List](Data-Structures/LISTS/DOUBLE/DoublyLinkedList.java)
-    * [Double Linked List using object data](Data-Structures/LISTS/Double-Linked-List/DoubleLinkedList.java)
-  * CIRCULAR
-    * [Circular Linked List (using tail node)](Data-Structures/LISTS/CIRCULAR/CircularLinkedList.java)
-  * MEMORY EFFICIENT DOUBLE LINKED LIST
-  * UNROLLED LINKED LIST
-  * SKIP LIST
-  * INBUILT LISTS
-    * [LINKED LIST]
-    * [ARRAYLIST](Data-Structures/LISTS/arrayList.java)
-    * [VECTORS](Data-Structures/LISTS/vectors.java)
-  * MISC
+* SINGLE
+  * [Single Linked List](Data-Structures/LISTS/SINGLE/LinkedList.java)
+  * [Single Linked List using object data](Data-Structures/LISTS/Single-Linked-List/singleLinkedList.java)
+* DOUBLE
+  * [Double Linked List](Data-Structures/LISTS/DOUBLE/DoublyLinkedList.java)
+  * [Double Linked List using object data](Data-Structures/LISTS/Double-Linked-List/DoubleLinkedList.java)
+* CIRCULAR
+  * [Circular Linked List (using tail node)](Data-Structures/LISTS/CIRCULAR/CircularLinkedList.java)
+* MEMORY EFFICIENT DOUBLE LINKED LIST
+* UNROLLED LINKED LIST
+* SKIP LIST
+* INBUILT LISTS
+  * [LINKED LIST]
+  * [ARRAYLIST](Data-Structures/LISTS/arrayList.java)
+  * [VECTORS](Data-Structures/LISTS/vectors.java)
+* MISC
 
 #### STACKS
 
@@ -51,6 +54,20 @@
 
 #### QUEUES
 
+* SIMPLE QUEUE
+  * FIXED ARRAY SIMPLE QUEUE
+  * DYNAMIC ARRAY SIMPLE QUEUE
+  * LINKED SIMPLE QUEUE
+* CIRCULAR QUEUE
+  * FIXED ARRAY CIRCULAR QUEUE
+  * LINKED CIRCULAR QUEUE
+* PRIORITY QUEUE
+  * FIXED ARRAY PRIORITY QUEUE
+  * LINKED PRIORITY QUEUE
+  * HEAPED PRIORITY QUEUE
+
+#### HASHTABLE
+
 #### TREES
 
 ##### BINARY TREES
@@ -71,6 +88,10 @@
     * LEVEL ORDER
       * [ITERATIVE](Data-Structures/TREES/BINARY-TREE/LevelOrder.java)
 
+#### GRAPHS
+
+#### BLOCKCHAIN
+
 ### :rocket: DYNAMIC PROGRAMMING
 
 ### :rocket: MISC

Java/README.md

@@ -20,14 +20,13 @@ Open Repository For Programmers to Contribute Algorithms and Data Structures in
 
 For documentation see [wiki](https://github.com/GauravWalia19/Algorithms-and-Data-Structures/wiki)
 
-* SORTING ALGORITHMS  
-  * [BUBBLE SORT](docs/bubble-sort.md)
-  * [SELECTION SORT](docs/selection-sort.md)
-  * [INSERTION SORT](docs/insertion-sort.md)
+For Algorithms docs follow [Algorithms](algorithms.md)
+
+For Data Structures docs follow [Data Structures](datastructures.md)
 
 ## Complexity Analysis
 
-See [COMPLEXITY](docs/complexity.md)
+For Analysis of particular algo see [COMPLEXITY](docs/complexity.md)
 
 ## Contribution Guide
 

README.md

@@ -49,13 +49,13 @@ Indexer for Data Structures Lover
   * [C++](C++/Data-Structures/ARRAYS/4darrays.cpp)
   * [JAVA](Java/Data-Structures/ARRAYS/fourDarray.java)
 
-### INBUILT ARRAY CLASSES
+### INBUILT
 
 #### ARRAYS CLASS(JAVA)
 
 * blog
 * docs
-* [arrays class in java](Java/Data-Structures/ARRAYS/arrays.java)
+* [arrays class in java](Java/Data-Structures/ARRAYS/INBUILT/arrays.java)
 
 #### ARRAY CLASS(C++)
 

datastructures.md

@@ -60,11 +60,10 @@ This page contains the complexities of different algorithms in this repository.
       * [ARRAYS CLASS IN JAVA](#arrays-class-in-java)
       * ARRAY CLASS IN C++
     * [MISC ARRAYS](#misc-arrays)
-      * HEAPED 1D ARRAY
-      * HEAPED 2D ARRAY
-      * HEAPED 3D ARRAY
+      * [HEAPED 1D ARRAY](#dynamic-1d-arrays-(CC++))
+      * [HEAPED 2D ARRAY](#dynamic-2d-arrays-(CC++))
+      * [HEAPED 3D ARRAY](#dynamic-3d-arrays-(CC++))
       * [JAGGED ARRAY](#jagged-array)
-
   * [STRING](#string)
     * Strings in C
     * [Strings in JAVA](#strings-in-java)
@@ -94,7 +93,6 @@ This page contains the complexities of different algorithms in this repository.
     * [INBUILT STACK](#inbuilt-stack)
       * JAVA
       * C++
-    * TWO WAY STACK
     * [MISC STACKS](#misc-stacks)
       * [BracketsBalancedOrNot]
   * QUEUES
@@ -124,10 +122,6 @@ This page contains the complexities of different algorithms in this repository.
     * INTERVAL TREES
     * HEAP TREE
   * GRAPHS
-  * HEAPS
-    * [DYNAMIC 1D ARRAY](#dynamic-1d-arrays-(CC++))
-    * [DYNAMIC 2D ARRAY](#dynamic-2d-arrays-(CC++))
-    * [DYNAMIC 3D ARRAY](#dynamic-3d-arrays-(CC++))
   * BLOCKCHAIN
 
 ## ALGORITHMS