Effectively insert node at beginning of circular linked list in ruby

Ruby program for Effectively insert node at beginning of circular linked list . Here more information.

#  Ruby Program 
#  Insert node at beginning of circular linked list
#  Using head and tail nodes

#  Define class of linked list Node
class LinkNode 
	# Define the accessor and reader of class LinkNode
	attr_reader :data, :next
	attr_accessor :data, :next
	def initialize(data, first) 
		#  Set node value
		self.data = data
		self.next = first
	end

end

class CircularLinkedList 
	# Define the accessor and reader of class CircularLinkedList
	attr_reader :head, :tail
	attr_accessor :head, :tail
	def initialize() 
		self.head = nil
		self.tail = nil
	end

	#  Insert node at begining of circular linked list
	def insert(value) 
		#  Create a node
		node = LinkNode.new(value, self.head)
		if (self.tail == nil) 
			#  First node of linked list
			self.tail = node
		end

		#  Make new head
		self.head = node
		#  Connecting the last node to the top of the next field
		self.tail.next = self.head
	end

	#  Display node element of circular linked list
	def display() 
		if (self.head == nil) 
			print("Empty Linked List\n")
		else
 
			print("Linked List Element :")
			temp = self.head
			#  iterate linked list
			while (temp != nil) 
				#  Display node
				print("  ", temp.data)
				if (temp == self.tail) 
					#  Stop iteration
					#  Or break
					return
				end

				#  Visit to next node
				temp = temp.next
			end

		end

	end

end

def main() 
	task = CircularLinkedList.new()
	#  Add following linked list nodes
	task.insert(8)
	task.insert(7)
	task.insert(6)
	task.insert(5)
	task.insert(4)
	task.insert(3)
	task.insert(2)
	task.insert(1)
	#  Display node
	task.display()
end

main()

Output

Linked List Element :  1  2  3  4  5  6  7  8