updated not working links

Author: groverkds

data_structures/5_Stack/5_stack_exercise.md

@@ -1,12 +1,12 @@
 ## Data structure tutorial exercise: Stack
-1. Write a function in python that can reverse a string using stack data structure. Use [Stack class](https://github.com/codebasics/py/tree/master/DataStructures/5_Stack/5_stack.ipynb) from the tutorial.
+1. Write a function in python that can reverse a string using stack data structure. Use [Stack class](https://github.com/codebasics/data-structures-algorithms-python/blob/master/data_structures/5_Stack/5_stack.ipynb) from the tutorial.
     ```
     reverse_string("We will conquere COVID-19") should return "91-DIVOC ereuqnoc lliw eW"
     ```
 
-[Solution](https://github.com/codebasics/py/tree/master/DataStructures/5_Stack/Exercise/reverse_string.py)
+[Solution](https://github.com/codebasics/data-structures-algorithms-python/blob/master/data_structures/5_Stack/Exercise/reverse_string.py)
 
-2. Write a function in python that checks if paranthesis in the string are balanced or not. Possible parantheses are "{}',"()" or "[]". Use [Stack class](https://github.com/codebasics/py/tree/master/DataStructures/5_Stack/5_stack.ipynb) from the tutorial.
+2. Write a function in python that checks if paranthesis in the string are balanced or not. Possible parantheses are "{}',"()" or "[]". Use [Stack class](https://github.com/codebasics/data-structures-algorithms-python/blob/master/data_structures/5_Stack/5_stack.ipynb) from the tutorial.
     ```
     is_balanced("({a+b})")     --> True
     is_balanced("))((a+b}{")   --> False
@@ -15,4 +15,4 @@
     is_balanced("[a+b]*(x+2y)*{gg+kk}") --> True
     ```
 
-[Solution](https://github.com/codebasics/py/tree/master/DataStructures/5_Stack/Exercise/balance_paran.py)
+[Solution](https://github.com/codebasics/data-structures-algorithms-python/blob/master/data_structures/5_Stack/Exercise/balance_paran.py)

data_structures/6_Queue/6_queue_exercise.md

@@ -15,7 +15,7 @@ For all exercises use [Queue class](https://github.com/codebasics/data-structure
     This problem is a producer,consumer problem where place_order thread is producing orders whereas server_order thread is consuming the food orders.
     Use Queue class implemented in a video tutorial.
 
-[Solution](https://github.com/codebasics/py/tree/master/DataStructures/6_Queue/Exercise/food_ordering_system.py)
+[Solution](https://github.com/codebasics/data-structures-algorithms-python/blob/master/data_structures/6_Queue/Exercise/food_ordering_system.py)
 
 2. Write a program to print binary numbers from 1 to 10 using Queue. Use Queue class implemented in main tutorial.
 Binary sequence should look like,
@@ -35,4 +35,4 @@ Hint: Notice a pattern above. After 1 second and third number is 1+0 and 1+1. 4t
 
 You also need to add front() function in queue class that can return the front element in the queue.
 
-[Solution](https://github.com/codebasics/py/tree/master/DataStructures/6_Queue/Exercise/binary_numbers.py)
+[Solution](https://github.com/codebasics/data-structures-algorithms-python/blob/master/data_structures/6_Queue/Exercise/binary_numbers.py)

data_structures/8_Binary_Tree_1/8_binary_tree_part_1_exercise.md

@@ -1,12 +1,12 @@
 ### Binary Tree Part 1 Exercise
 
-Add following methods to [BinarySearchTreeNode class](https://github.com/codebasics/py/tree/master/DataStructures/8_Binary_Tree_1/binary_tree_part_1.py) created in main video tutorial
+Add following methods to [BinarySearchTreeNode class](https://github.com/codebasics/data-structures-algorithms-python/blob/master/data_structures/8_Binary_Tree_1/binary_tree_part_1.py) created in main video tutorial
 
     1. find_min(): finds minimum element in entire binary tree
     2. find_max(): finds maximum element in entire binary tree
     3. calculate_sum(): calcualtes sum of all elements
     4. post_order_traversal(): performs post order traversal of a binary tree
     5. pre_order_traversal(): perofrms pre order traversal of a binary tree
 
-[Solution](https://github.com/codebasics/py/tree/master/DataStructures/8_Binary_Tree_1/Exercise/binary_tree_part_1_exercise.py)
+[Solution](https://github.com/codebasics/data-structures-algorithms-python/blob/master/data_structures/8_Binary_Tree_1/Exercise/binary_tree_part_1_exercise.py)
 

data_structures/9_Binary_Tree_2/9_binary_tree_part_2_exercise.md

@@ -1,6 +1,6 @@
 ### Binary Tree Part 2 Exercise
 
-Modify delete method in class [BinarySearchTreeNode class](https://github.com/codebasics/py/tree/master/DataStructures/9_Binary_Tree_2/binary_tree_part_2.py)
+Modify delete method in class [BinarySearchTreeNode class](https://github.com/codebasics/data-structures-algorithms-python/blob/master/data_structures/9_Binary_Tree_2/binary_tree_part_2.py)
 to use min element from left subtree. You will remove lines marked with ---> and use max value from left subtree
 
 ```
@@ -24,5 +24,5 @@ to use min element from left subtree. You will remove lines marked with ---> and
           --->  self.right = self.right.delete(min_val)
 ```
 
-[Solution](https://github.com/codebasics/py/tree/master/DataStructures/9_Binary_Tree_2/Exercise/binary_tree_part_2_exercise.py)
+[Solution](https://github.com/codebasics/data-structures-algorithms-python/blob/master/data_structures/9_Binary_Tree_2/Exercise/binary_tree_part_2_exercise.py)