From b4842100ea7492eb52b80141ee5a0f6408bdb39f Mon Sep 17 00:00:00 2001
From: Ramya Korupolu <104009248+Ramya-korupolu@users.noreply.github.com>
Date: Sun, 23 Jun 2024 12:24:08 +0530
Subject: [PATCH] Update Tree-Traversal.md

---
 contrib/ds-algorithms/Tree-Traversal.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

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