Updated README

README.md

@@ -1,2 +1,55 @@
 # Data-Structures-Algorithms
-Solving problems and learning the use of different data structures and algorithms, it makes us capable to decide which algorithm works best in different scenarios and to understand the trade offs between one data structure over the other.
+
+The Topics and Algorithms covered in this repository are as follows:
+
+* Sorting Algorithms
+    * Merge Sort
+    * Heap Sort
+    * Quick Sort
+* Trees
+    * Basic operations (Insert, delete)
+    * BFS (in-order, pre-order, post-order)
+    * DFS (Level order)
+    * Left view
+    * Right view
+    * Top view
+    * Bottom view
+    * Left-bottom view
+    * Boundary leaves traversal
+    * Zig-zak traversal
+    * Spiral traversal
+    * IsSum tree, IsBST
+    * Nodes at distance K, distance between nodes
+    * Lowest common ancestor(LCS) in BST and Btree
+    * Is symmetric or mirror tree
+    * Tree from in-order and pre-order/post-order
+    * BST to DLL
+    * Btree to DLL
+* Matrix
+    * Boolean Matrix
+    * Min/Max cost path in Matrix
+    * Matrix path exists
+    * Rotate matrix by 90 degrees
+    * Rotten tomatoes problem
+    * Spiral traversal of Matrix
+* Linked Lists (SLL, DLL)
+    * Basic operations(Insert, delete, middle)
+    * Reverse, K-nodes reverse (Iterative, recursive)
+    * Check LL is palindrome
+    * Dutch national flag problem(separate 0's, 1's, 2's)
+    * Add two number represented in linked lists
+    * Merge sort on SLL, DLL
+    * Detect and correct loop in linked list
+* Heaps
+    * Min heap implementation
+    * Max heap implementation
+    * Kth min/max in array
+    * Sort almost sorted array
+    * Merge K sorted arrays
+    * Kth largest/smallest element in stream
+    * Median in stream using two heaps
+* Arrays
+    * Chocolate distribution problem
+    * Sliding window problem
+    * Rain water trapping problem
+    * Largest number smaller than N with same digits