Linked list implementation of stack in go

stack_linked_list.go

type Node struct {
	val  int
	next *Node
}

type LinkedList struct {
	head *Node
}

func (ll *LinkedList) insert(n int) {
	//add to front of linked list
	newNode := &Node{
		val:  n,
		next: nil,
	}
	newNode.next = ll.head
	ll.head = newNode
}

func (ll *LinkedList) removeFirstNode() *Node {
	firstNode := ll.head
	ll.head = ll.head.next
	return firstNode
}

type Stack struct {
	data LinkedList
	size int
}

func (s *Stack) push(n int) {
	s.data.insert(n)
	s.size = s.size + 1
}

func (s *Stack) pop() int {
	first := s.data.removeFirstNode()
	s.size = s.size - 1
	return first.val
}

func (s *Stack) isEmpty() bool {
	return s.size == 0
}