updated data strcutures

Author: GauravWalia19

datastructures.md

@@ -12,9 +12,11 @@ Indexer for Data Structures Lover
   * [C](C/Data-Structures/ARRAYS/1darrays.c)
   * [C++](C++/Data-Structures/ARRAYS/1darrays.cpp)
   * [JAVA](Java/Data-Structures/ARRAYS/oneDarray.java)
+  * complexity
 * implementation using heaps
   * [C](C/Data-Structures/HEAPS/dynamicarray.c)
   * [C++](C++/Data-Structures/HEAPS/1darray.cpp)
+  * complexity
 
 ### 2 DIMENSIONAL
 
@@ -24,9 +26,11 @@ Indexer for Data Structures Lover
   * [C](C/Data-Structures/ARRAYS/2darrays.c)
   * [C++](C++/Data-Structures/ARRAYS/2darrays.cpp)
   * [JAVA](Java/Data-Structures/ARRAYS/twoDarray.java)
+  * complexity
 * implementation using heaps
   * [C](C/Data-Structures/HEAPS/dynamic2d.c)
   * [C++](C++/Data-Structures/HEAPS/2darray.cpp)
+  * complexity
 
 ### 3 DIMENSIONAL
 
@@ -36,9 +40,11 @@ Indexer for Data Structures Lover
   * [C](C/Data-Structures/ARRAYS/3darrays.c)
   * [C++](C++/Data-Structures/ARRAYS/3darrays.cpp)
   * [JAVA](Java/Data-Structures/ARRAYS/threeDarray.java)
+  * complexity
 * implementation using heaps
   * [C](C/Data-Structures/HEAPS/dynamic3d.c)
   * [C++](C++/Data-Structures/HEAPS/1darray.cpp)
+  * complexity
 
 ### 4 DIMENSIONAL
 
@@ -48,36 +54,42 @@ Indexer for Data Structures Lover
   * [C](C/Data-Structures/ARRAYS/4darrays.c)
   * [C++](C++/Data-Structures/ARRAYS/4darrays.cpp)
   * [JAVA](Java/Data-Structures/ARRAYS/fourDarray.java)
+* complexity
 
 ### INBUILT
 
 #### ARRAYS CLASS(JAVA)
 
 * blog
 * docs
-* [arrays class in java](Java/Data-Structures/ARRAYS/INBUILT/arrays.java)
+* implementation
+  * [JAVA](Java/Data-Structures/ARRAYS/INBUILT/arrays.java)
+* complexity
 
 #### ARRAY CLASS(C++)
 
 * blog
 * docs
 * array class in c++
+* complexity
 
-### MISC
+### MISC ARRAYS
 
 #### JAGGED
 
 * blog
 * docs
 * implementation
   * [C](C/Data-Structures/ARRAYS/jaggedarray.c)
+* complexity
 
 ## :octocat: STRING
 
 * blog
 * docs
 * implementation
   * [JAVA](Java/Data-Structures/STRING/Strings.java)
+* complexity
 
 ## :octocat: LISTS
 
@@ -88,30 +100,48 @@ Indexer for Data Structures Lover
 * implementation
   * [C](C/Data-Structures/LINKED-LIST/SINGLE/Main.c)
   * [C++](C++/Data-Structures/LISTS/LINKED-LIST/SINGLE/Main.cpp)
+  * JAVA
+    * [Single Linked List](Java/Data-Structures/LISTS/SINGLE/STANDARD/LinkedList.java)
+    * [Single Linked List using object data](Java/Data-Structures/LISTS/SINGLE/Single-Using-Object/singleLinkedList.java)
+* complexity
 
 ### DOUBLE
 
 * blog
 * docs
 * implementation
   * [C](C/Data-Structures/LINKED-LIST/DOUBLE/Main.c)
+  * JAVA
+    * [Double Linked List](Java/Data-Structures/LISTS/DOUBLE/STANDARD/DoublyLinkedList.java)
+    * [Double Linked List using object data](Java/Data-Structures/LISTS/DOUBLE/Double-Using-Object/DoubleLinkedList.java)
+* complexity
 
 ### CIRCULAR
 
+* blog
+* docs
+* implementation
+  * [JAVA](Java/Data-Structures/LISTS/CIRCULAR/STANDARD/CircularLinkedList.java)
+* complexity
+
 ### INBUILT LISTS
 
 #### ARRAYLIST
 
 * blog
 * docs
 * implementation
+  * [JAVA](Java/Data-Structures/LISTS/INBUILT/arrayList.java)
+* complexity
 
 #### VECTOR
 
 * blog
 * docs
 * implementation
   * [C++](C++/Data-Structures/LISTS/VECTORS/Main.cpp)
+  * [JAVA](Java/Data-Structures/LISTS/INBUILT/vectors.java)
+* complexity
 
 #### LINKED LIST
 
@@ -121,6 +151,33 @@ Indexer for Data Structures Lover
 * docs
 * implementation
   * [PYTHON](Python3/Data-Structures/LISTS/inbuiltList.py)
+* complexity
+
+### MISC LISTS
+
+#### Find the nth node from end in single linked list
+
+* blog
+* docs
+* implementation
+  * APPROACH 1: Compute the size while adding
+    * [JAVA](Java/Data-Structures/LISTS/MISC/Nth-node-from-end/Approach1.java)
+  
+  * APPROACH 2: Using two current pointers
+    * [JAVA](Java/Data-Structures/LISTS/MISC/Nth-node-from-end/Approach2.java)
+  
+  * APPROACH 3: Using hashtable
+    * [JAVA](Java/Data-Structures/LISTS/MISC/Nth-node-from-end/Approach3.java)
+  
+  * APPROACH 4: Using Hashtable while adding
+    * [JAVA](Java/Data-Structures/LISTS/MISC/Nth-node-from-end/Approach4.java)
+  
+  * APPROACH 5: Finding node in one scan
+    * [JAVA](Java/Data-Structures/LISTS/MISC/Nth-node-from-end/Approach5.java)
+  
+  * APPROACH 6: Using recursion
+    * [JAVA](Java/Data-Structures/LISTS/MISC/Nth-node-from-end/Approach6.java)
+* complexity
 
 ## :octocat: STACKS
 
@@ -131,6 +188,7 @@ Indexer for Data Structures Lover
 * implementation
   * [C++](C++/Data-Structures/STACKS/Stack.hpp)
   * [JAVA](Java/Data-Structures/STACKS/FIXED-ARRAY-STACK/ArrayStack.java)
+* complexity
 
 ### DYNAMIC ARRAY STACK
 
@@ -140,6 +198,7 @@ Indexer for Data Structures Lover
 * docs
 * implementation
   * [JAVA](Java/Data-Structures/STACKS/LINKED-STACK/LinkedStack.java)
+* complexity
 
 ### INBUILT STACKS
 
@@ -148,6 +207,7 @@ Indexer for Data Structures Lover
 * implementation
   * [C++](C++/Data-Structures/STACKS/stack.cpp)
   * [JAVA](Java/Data-Structures/STACKS/INBUILT-STACK/Stacks.java)
+* complexity
 
 ### MISC STACKS
 
@@ -157,27 +217,31 @@ Indexer for Data Structures Lover
 * docs
 * implementation
   * [C](C/Data-Structures/STACKS/MISC-STACKS/minimum_bracket_reversal_for_balanced_expression.c)
+* complexity
 
 #### Given expression has balanced brackets or not
 
 * blog
 * docs
 * implementation
   * [JAVA](Java/Data-Structures/STACKS/MISC-STACKS/BracketsBalancedOrNot.java)
+* complexity
 
 #### Postfix Evaluation
 
 * blog
 * docs
 * implementation
   * [C](C/Data-Structures/STACKS/MISC-STACKS/postfix_evaluation.c)
+* complexity
 
 #### TWO WAY STACK
 
 * blog
 * docs
 * implementation
   * [C++](C++/Data-Structures/STACKS/Tstack.hpp)
+* complexity
 
 ## :octocat: QUEUES
 
@@ -190,19 +254,28 @@ Indexer for Data Structures Lover
 ##### DEPTH FIRST SEARCH
 
 * IN ORDER
-  * [ITERATIVE](Data-Structures/TREES/BINARY-TREE/IterativeInorder.java)
-  * [RECURSIVE](Data-Structures/TREES/BINARY-TREE/Inorder.java)
+  * ITERATIVE
+    * [JAVA](Java/Data-Structures/TREES/BINARY-TREE/IterativeInorder.java)
+  * RECURSIVE
+    * [JAVA](Java/Data-Structures/TREES/BINARY-TREE/Inorder.java)
+
 * PRE ORDER
-  * [ITERATIVE](Data-Structures/TREES/BINARY-TREE/IterativePreorder.java)
-  * [RECURSIVE](Data-Structures/TREES/BINARY-TREE/Preorder.java)
+  * ITERATIVE
+    * [JAVA](Java/Data-Structures/TREES/BINARY-TREE/IterativePreorder.java)
+  * RECURSIVE
+    * [JAVA](Java/Data-Structures/TREES/BINARY-TREE/Preorder.java)
+
 * POST ORDER
-  * [ITERATIVE](Data-Structures/TREES/BINARY-TREE/IterativePostorder.java)
-  * [RECURSIVE](Data-Structures/TREES/BINARY-TREE/Postorder.java)
+  * ITERATIVE
+    * [JAVA](Java/Data-Structures/TREES/BINARY-TREE/IterativePostorder.java)
+  * RECURSIVE
+    * [JAVA](Java/Data-Structures/TREES/BINARY-TREE/Postorder.java)
 
 ##### BREADTH FIRST SEARCH
 
 * LEVEL ORDER
-  * [ITERATIVE](Data-Structures/TREES/BINARY-TREE/LevelOrder.java)
+  * ITERATIVE
+    * [JAVA](Java/Data-Structures/TREES/BINARY-TREE/LevelOrder.java)
 
 ### GENERIC TREES