From a0e7c07ecf8b439560017cc052049acd2712a60a Mon Sep 17 00:00:00 2001
From: AyushRaghuvanshi <62144720+AyushRaghuvanshi@users.noreply.github.com>
Date: Fri, 21 Oct 2022 20:54:16 +0530
Subject: [PATCH] Add binary search tree resource (#2614)
I added a Geek for Geeks Link for Problem Set as User Should get the access to proper practice problems as well.
---
.../103-binary-search-trees.md | 1 +
1 file changed, 1 insertion(+)
diff --git a/content/roadmaps/108-python/content/101-data-structures-and-algorithms/103-binary-search-trees.md b/content/roadmaps/108-python/content/101-data-structures-and-algorithms/103-binary-search-trees.md
index d74b48cd9..7093ae131 100644
--- a/content/roadmaps/108-python/content/101-data-structures-and-algorithms/103-binary-search-trees.md
+++ b/content/roadmaps/108-python/content/101-data-structures-and-algorithms/103-binary-search-trees.md
@@ -6,5 +6,6 @@ A binary search tree, also called an ordered or sorted binary tree, is a rooted
Tree Data Structure | Illustrated Data Structures
Writing a Binary Search Tree in Python with Examples
How to Implement Binary Search Tree in Python
+Problem Set