From 2f5eb55d71a62818ce1a2abfc2c9e2d057e975ae Mon Sep 17 00:00:00 2001
From: Ramya Korupolu <104009248+Ramya-korupolu@users.noreply.github.com>
Date: Sun, 23 Jun 2024 12:21:14 +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 1336928..cd19515 100644
--- a/contrib/ds-algorithms/Tree-Traversal.md
+++ b/contrib/ds-algorithms/Tree-Traversal.md
@@ -17,7 +17,7 @@ A Tree Data Structure can be traversed in following ways:
 ## Binary Tree Structure
   Before diving into traversal techniques, let's define a simple binary tree node structure:
 
-![Binary Tree](images/binarytree.png)
+![Binary Tree](images/binarytree.png))
   
   ```python
 class Node: