From f7b7a140f69e730bfe424f3864a928fc225f16d3 Mon Sep 17 00:00:00 2001
From: Sachin Bhatt <111337936+Sachinbhatttech@users.noreply.github.com>
Date: Thu, 18 Aug 2022 17:25:43 +0530
Subject: [PATCH] Added a new resource

Hey, I have added a reference link for Complete Binary Tree. I came upon this article while looking for resources to learn about Binary Tree. This citation, in my opinion, will enhance the content of this article. Hope that my contribution will benefit other learners.
---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 1cf0a69..8305d46 100644
--- a/README.md
+++ b/README.md
@@ -62,7 +62,7 @@ This is my way of saying - change your interview style. There are lots of smart
 | [Insertion Sort](https://en.wikipedia.org/wiki/Insertion_sort)                                                                | [click](https://github.com/sagivo/algorithms/blob/master/src/insertion_sort.rb)                                                                                                               |
 | [Towers of Hanoi using Stack](https://en.wikipedia.org/wiki/Tower_of_Hanoi) | [click](blob/master/src/towers_of_hanoi_with_stack.rb)
 | [Tarjan's strongly connected components finder](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm)                                                                | [click](https://github.com/sagivo/algorithms/blob/master/src/tarjan.rb)                                                   |
-
+| [Complete Binary Tree](https://www.scaler.com/topics/complete-binary-tree/)                                                                                                                  | [click](https://github.com/sagivo/algorithms/blob/master/src/gcd.rb)                                                                                                               |
 
 # How?  
 Simply run `ruby some_file.rb` to execute the algorithm. At the bottom of each file there are some test samples.