diff --git a/datastructure/queue/circularqueue.go b/datastructure/queue/circularqueue.go
index 5fdf3e5..53f655e 100644
--- a/datastructure/queue/circularqueue.go
+++ b/datastructure/queue/circularqueue.go
@@ -9,10 +9,10 @@ import (
 // CircularQueue implements circular queue with slice,
 // last index of CircularQueue don't contain value, so acturl capacity is capacity - 1
 type CircularQueue[T any] struct {
-	data  []T
-	front int
-	rear  int
-	capacity  int
+	data     []T
+	front    int
+	rear     int
+	capacity int
 }
 
 // NewCircularQueue return a empty CircularQueue pointer
diff --git a/datastructure/queue/linkedqueue.go b/datastructure/queue/linkedqueue.go
index 93c6ff8..8e4f90d 100644
--- a/datastructure/queue/linkedqueue.go
+++ b/datastructure/queue/linkedqueue.go
@@ -42,7 +42,6 @@ func (q *LinkedQueue[T]) IsEmpty() bool {
 	return q.length == 0
 }
 
-
 // Enqueue put element into queue
 func (q *LinkedQueue[T]) Enqueue(value T) {
 	newNode := datastructure.NewQueueNode(value)