diff --git a/contrib/ds-algorithms/Tree-Traversal.md b/contrib/ds-algorithms/Tree-Traversal.md
index cd19515..1fa6fe5 100644
--- a/contrib/ds-algorithms/Tree-Traversal.md
+++ b/contrib/ds-algorithms/Tree-Traversal.md
@@ -125,7 +125,7 @@ def printInorder(root):
 
 In this traversal method, the root node is visited first, then the left subtree and finally the right subtree.
 
-![preorder](images/preorder-traversal.png)
+![preorder](images/Preorder%20traversal.png))
 
 **The order:**  Root -> Left -> Right