From 2c1df477e256a9d5b3920ba8eb252da21993ef22 Mon Sep 17 00:00:00 2001
From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com>
Date: Mon, 7 Aug 2023 18:51:39 -0700
Subject: [PATCH] Update circular_queue_array.py

---
 queues/circular_queue_array.py | 14 ++++++--------
 1 file changed, 6 insertions(+), 8 deletions(-)

diff --git a/queues/circular_queue_array.py b/queues/circular_queue_array.py
index 2c4ad73..e56fddd 100644
--- a/queues/circular_queue_array.py
+++ b/queues/circular_queue_array.py
@@ -5,22 +5,19 @@
 
 class CircularQueue:
 
-    def __init__(self, k: int):
+    def __init__(self, size):
         self.head = 0
         self.tail = 0
-        self.size = k
+        self.size = size
         self.queue = [None] * self.size
         
     def enqueue(self, value: int) -> bool:
-
-        if value is None:
-            return False
             
         if self.is_full():
             return False
 
         if self.is_empty():
-            self.heard = 0
+            self.head = 0
         
         while self.queue[self.tail] is not None:
             self.tail += 1 
@@ -28,6 +25,7 @@ class CircularQueue:
                 self.tail = 0
     
         self.queue[self.tail] = value
+        
         return True
 
     def dequeue(self) -> bool:
@@ -45,10 +43,10 @@ class CircularQueue:
         return True
 
     def front(self) -> int:
-        return self.queue[self.head] or -1
+        return self.queue[self.head] or False
         
     def rear(self) -> int:
-        return self.queue[self.tail] or -1
+        return self.queue[self.tail] or False
         
     def is_empty(self) -> bool:
         for n in self.queue: