Update README.md

README.md

@@ -1,9 +1,9 @@
 # RustyDSA
 
-### [Stack](./data_structure/stack.rs)
+### [Stack](./src/data_structure/stack.rs)
 A stack is a linear data structure that follows the Last-In-First-Out (LIFO) principle. 
 Elements are added and removed from the top, or "topmost" end of the stack. It operates like a collection of items stacked on top of each other, where the last item added is the first to be removed. 
 Stacks are used in various applications, such as managing function calls in programming, tracking navigation history, and implementing undo operations. 
 Common operations on a stack include push (adding an element), pop (removing the top element), and peek (viewing the top element without removal).
 
-* [Wikipedia](https://en.wikipedia.org/wiki/Stack_(abstract_data_type)
+* [Wikipedia](https://en.wikipedia.org/wiki/Stack_(abstract_data_type))