@@ -12,9 +12,11 @@ Indexer for Data Structures Lover
1212 * [ C] ( C/Data-Structures/ARRAYS/1darrays.c )
1313 * [ C++] ( C++/Data-Structures/ARRAYS/1darrays.cpp )
1414 * [ JAVA] ( Java/Data-Structures/ARRAYS/oneDarray.java )
15+ * complexity
1516* implementation using heaps
1617 * [ C] ( C/Data-Structures/HEAPS/dynamicarray.c )
1718 * [ C++] ( C++/Data-Structures/HEAPS/1darray.cpp )
19+ * complexity
1820
1921### 2 DIMENSIONAL
2022
@@ -24,9 +26,11 @@ Indexer for Data Structures Lover
2426 * [ C] ( C/Data-Structures/ARRAYS/2darrays.c )
2527 * [ C++] ( C++/Data-Structures/ARRAYS/2darrays.cpp )
2628 * [ JAVA] ( Java/Data-Structures/ARRAYS/twoDarray.java )
29+ * complexity
2730* implementation using heaps
2831 * [ C] ( C/Data-Structures/HEAPS/dynamic2d.c )
2932 * [ C++] ( C++/Data-Structures/HEAPS/2darray.cpp )
33+ * complexity
3034
3135### 3 DIMENSIONAL
3236
@@ -36,9 +40,11 @@ Indexer for Data Structures Lover
3640 * [ C] ( C/Data-Structures/ARRAYS/3darrays.c )
3741 * [ C++] ( C++/Data-Structures/ARRAYS/3darrays.cpp )
3842 * [ JAVA] ( Java/Data-Structures/ARRAYS/threeDarray.java )
43+ * complexity
3944* implementation using heaps
4045 * [ C] ( C/Data-Structures/HEAPS/dynamic3d.c )
4146 * [ C++] ( C++/Data-Structures/HEAPS/1darray.cpp )
47+ * complexity
4248
4349### 4 DIMENSIONAL
4450
@@ -48,36 +54,42 @@ Indexer for Data Structures Lover
4854 * [ C] ( C/Data-Structures/ARRAYS/4darrays.c )
4955 * [ C++] ( C++/Data-Structures/ARRAYS/4darrays.cpp )
5056 * [ JAVA] ( Java/Data-Structures/ARRAYS/fourDarray.java )
57+ * complexity
5158
5259### INBUILT
5360
5461#### ARRAYS CLASS(JAVA)
5562
5663* blog
5764* docs
58- * [ arrays class in java] ( Java/Data-Structures/ARRAYS/INBUILT/arrays.java )
65+ * implementation
66+ * [ JAVA] ( Java/Data-Structures/ARRAYS/INBUILT/arrays.java )
67+ * complexity
5968
6069#### ARRAY CLASS(C++)
6170
6271* blog
6372* docs
6473* array class in c++
74+ * complexity
6575
66- ### MISC
76+ ### MISC ARRAYS
6777
6878#### JAGGED
6979
7080* blog
7181* docs
7282* implementation
7383 * [ C] ( C/Data-Structures/ARRAYS/jaggedarray.c )
84+ * complexity
7485
7586## :octocat: STRING
7687
7788* blog
7889* docs
7990* implementation
8091 * [ JAVA] ( Java/Data-Structures/STRING/Strings.java )
92+ * complexity
8193
8294## :octocat: LISTS
8395
@@ -88,30 +100,48 @@ Indexer for Data Structures Lover
88100* implementation
89101 * [ C] ( C/Data-Structures/LINKED-LIST/SINGLE/Main.c )
90102 * [ C++] ( C++/Data-Structures/LISTS/LINKED-LIST/SINGLE/Main.cpp )
103+ * JAVA
104+ * [ Single Linked List] ( Java/Data-Structures/LISTS/SINGLE/STANDARD/LinkedList.java )
105+ * [ Single Linked List using object data] ( Java/Data-Structures/LISTS/SINGLE/Single-Using-Object/singleLinkedList.java )
106+ * complexity
91107
92108### DOUBLE
93109
94110* blog
95111* docs
96112* implementation
97113 * [ C] ( C/Data-Structures/LINKED-LIST/DOUBLE/Main.c )
114+ * JAVA
115+ * [ Double Linked List] ( Java/Data-Structures/LISTS/DOUBLE/STANDARD/DoublyLinkedList.java )
116+ * [ Double Linked List using object data] ( Java/Data-Structures/LISTS/DOUBLE/Double-Using-Object/DoubleLinkedList.java )
117+ * complexity
98118
99119### CIRCULAR
100120
121+ * blog
122+ * docs
123+ * implementation
124+ * [ JAVA] ( Java/Data-Structures/LISTS/CIRCULAR/STANDARD/CircularLinkedList.java )
125+ * complexity
126+ 101127### INBUILT LISTS
102128
103129#### ARRAYLIST
104130
105131* blog
106132* docs
107133* implementation
134+ * [ JAVA] ( Java/Data-Structures/LISTS/INBUILT/arrayList.java )
135+ * complexity
108136
109137#### VECTOR
110138
111139* blog
112140* docs
113141* implementation
114142 * [ C++] ( C++/Data-Structures/LISTS/VECTORS/Main.cpp )
143+ * [ JAVA] ( Java/Data-Structures/LISTS/INBUILT/vectors.java )
144+ * complexity
115145
116146#### LINKED LIST
117147
@@ -121,6 +151,33 @@ Indexer for Data Structures Lover
121151* docs
122152* implementation
123153 * [ PYTHON] ( Python3/Data-Structures/LISTS/inbuiltList.py )
154+ * complexity
155+ 156+ ### MISC LISTS
157+ 158+ #### Find the nth node from end in single linked list
159+ 160+ * blog
161+ * docs
162+ * implementation
163+ * APPROACH 1: Compute the size while adding
164+ * [ JAVA] ( Java/Data-Structures/LISTS/MISC/Nth-node-from-end/Approach1.java )
165+ 166+ * APPROACH 2: Using two current pointers
167+ * [ JAVA] ( Java/Data-Structures/LISTS/MISC/Nth-node-from-end/Approach2.java )
168+ 169+ * APPROACH 3: Using hashtable
170+ * [ JAVA] ( Java/Data-Structures/LISTS/MISC/Nth-node-from-end/Approach3.java )
171+ 172+ * APPROACH 4: Using Hashtable while adding
173+ * [ JAVA] ( Java/Data-Structures/LISTS/MISC/Nth-node-from-end/Approach4.java )
174+ 175+ * APPROACH 5: Finding node in one scan
176+ * [ JAVA] ( Java/Data-Structures/LISTS/MISC/Nth-node-from-end/Approach5.java )
177+ 178+ * APPROACH 6: Using recursion
179+ * [ JAVA] ( Java/Data-Structures/LISTS/MISC/Nth-node-from-end/Approach6.java )
180+ * complexity
124181
125182## :octocat: STACKS
126183
@@ -131,6 +188,7 @@ Indexer for Data Structures Lover
131188* implementation
132189 * [ C++] ( C++/Data-Structures/STACKS/Stack.hpp )
133190 * [ JAVA] ( Java/Data-Structures/STACKS/FIXED-ARRAY-STACK/ArrayStack.java )
191+ * complexity
134192
135193### DYNAMIC ARRAY STACK
136194
@@ -140,6 +198,7 @@ Indexer for Data Structures Lover
140198* docs
141199* implementation
142200 * [ JAVA] ( Java/Data-Structures/STACKS/LINKED-STACK/LinkedStack.java )
201+ * complexity
143202
144203### INBUILT STACKS
145204
@@ -148,6 +207,7 @@ Indexer for Data Structures Lover
148207* implementation
149208 * [ C++] ( C++/Data-Structures/STACKS/stack.cpp )
150209 * [ JAVA] ( Java/Data-Structures/STACKS/INBUILT-STACK/Stacks.java )
210+ * complexity
151211
152212### MISC STACKS
153213
@@ -157,27 +217,31 @@ Indexer for Data Structures Lover
157217* docs
158218* implementation
159219 * [ C] ( C/Data-Structures/STACKS/MISC-STACKS/minimum_bracket_reversal_for_balanced_expression.c )
220+ * complexity
160221
161222#### Given expression has balanced brackets or not
162223
163224* blog
164225* docs
165226* implementation
166227 * [ JAVA] ( Java/Data-Structures/STACKS/MISC-STACKS/BracketsBalancedOrNot.java )
228+ * complexity
167229
168230#### Postfix Evaluation
169231
170232* blog
171233* docs
172234* implementation
173235 * [ C] ( C/Data-Structures/STACKS/MISC-STACKS/postfix_evaluation.c )
236+ * complexity
174237
175238#### TWO WAY STACK
176239
177240* blog
178241* docs
179242* implementation
180243 * [ C++] ( C++/Data-Structures/STACKS/Tstack.hpp )
244+ * complexity
181245
182246## :octocat: QUEUES
183247
@@ -190,19 +254,28 @@ Indexer for Data Structures Lover
190254##### DEPTH FIRST SEARCH
191255
192256* IN ORDER
193- * [ ITERATIVE] ( Data-Structures/TREES/BINARY-TREE/IterativeInorder.java )
194- * [ RECURSIVE] ( Data-Structures/TREES/BINARY-TREE/Inorder.java )
257+ * ITERATIVE
258+ * [ JAVA] ( Java/Data-Structures/TREES/BINARY-TREE/IterativeInorder.java )
259+ * RECURSIVE
260+ * [ JAVA] ( Java/Data-Structures/TREES/BINARY-TREE/Inorder.java )
261+ 195262* PRE ORDER
196- * [ ITERATIVE] ( Data-Structures/TREES/BINARY-TREE/IterativePreorder.java )
197- * [ RECURSIVE] ( Data-Structures/TREES/BINARY-TREE/Preorder.java )
263+ * ITERATIVE
264+ * [ JAVA] ( Java/Data-Structures/TREES/BINARY-TREE/IterativePreorder.java )
265+ * RECURSIVE
266+ * [ JAVA] ( Java/Data-Structures/TREES/BINARY-TREE/Preorder.java )
267+ 198268* POST ORDER
199- * [ ITERATIVE] ( Data-Structures/TREES/BINARY-TREE/IterativePostorder.java )
200- * [ RECURSIVE] ( Data-Structures/TREES/BINARY-TREE/Postorder.java )
269+ * ITERATIVE
270+ * [ JAVA] ( Java/Data-Structures/TREES/BINARY-TREE/IterativePostorder.java )
271+ * RECURSIVE
272+ * [ JAVA] ( Java/Data-Structures/TREES/BINARY-TREE/Postorder.java )
201273
202274##### BREADTH FIRST SEARCH
203275
204276* LEVEL ORDER
205- * [ ITERATIVE] ( Data-Structures/TREES/BINARY-TREE/LevelOrder.java )
277+ * ITERATIVE
278+ * [ JAVA] ( Java/Data-Structures/TREES/BINARY-TREE/LevelOrder.java )
206279
207280### GENERIC TREES
208281
0 commit comments