From 937f04f51cc07ce611bfd148af94edf20c854d1f Mon Sep 17 00:00:00 2001
From: Ramya Korupolu <104009248+Ramya-korupolu@users.noreply.github.com>
Date: Sun, 23 Jun 2024 12:30: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 1fa6fe5..4ec72ee 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%20traversal.png))
+![preorder](images/preorder-traversal.png))
 
 **The order:**  Root -> Left -> Right