my Implementation of a linked list, and more

link_list.rb

class Node
	attr_accessor :data, :next

	def initialize(data=nil)
		@data = data
	end

	def to_s
		data.to_s
	end
end

class List
	attr_accessor :head, :tail
	attr_reader :count

	def initialize
		@head = nil
		@tail = nil
		@count = 0
	end

	def insertFirst(val)
		node = Node.new(val)
		if @head.nil?
			@head = node
			@tail = node
		else
			node.next = @head
			@head = node
		end
		@count += 1
	end

	def insertLast(val)
		node = Node.new(val)
		if @head.nil?
			@head = node
			@tail = node
		else
			@tail.next = node
			@tail = node
		end
		@count += 1
	end

	def insertAt(val, i)
		node = Node.new(val)
		if i == 0
			node.next = @head
			@head = node
			@count += 1
		elsif i == @count - 1
			@tail.next = node
			@tail = node
			@count += 1
		elsif i < @count - 1
			temp = @head
			i += -1
			i.times do
				temp = temp.next
			end
			node.next = temp.next
			temp.next = node
			@count += 1
		end
	end

	def last
		@tail
	end

	def count
		@count
	end

	def average
		total = @head.data
		node = @head
		(@count - 1).times do
			node = node.next
			total += node.data
		end
		total/@count
	end

	def reverse
		array = self.to_a
		x = array.length
		list = List.new
		array.each do |val|
			list.insertFirst(val)
		end
		return list
	end

	def +(list)
		node = list.head
		list.count.times do
			self.insertLast node
			node = node.next
		end
		self
	end

	def to_a
		array = []
		node = @head
		@count.times do
			array << node.data
			node = node.next
		end
		array
	end

	def to_s
		array = []
		node = @head
		@count.times do
			array << node.data
			node = node.next
		end
		array.inspect
	end
end

def palindrome(list)
	listStart = list
	listEnd = list.reverse
	p = listStart + listEnd
end