Gabriel Bussolo gabrielbussolo

## bfs.go
package main

import (
	"container/list"
	"fmt"
)

type Node struct {
	Key   int
	Left  *Node

## fibonacci.go
package main

import "fmt"

func fibonacci(num int) int {
	if num == 0 {
		return 0
	}
	if num == 1 {
		return 1

## graph.go
package main

import "fmt"

type Graph struct {
	vertices map[int][]int
}

func (g *Graph) AddVertice(vert int) {
	if g.vertices == nil {

## queue.go
package main

import "fmt"

type Queue struct {
	Head *Node
	Tail *Node
}

type Node struct {

## stack_array.go
package main

import "fmt"

type Stack struct {
	data []int
}

func (s *Stack) Push(element int) {
	s.data = append(s.data, element)

## stack.go
package main

import (
	"fmt"
)

type Node struct {
	Data int
	Next *Node
}

## singlylinkedlist.go
package main

import (
	"fmt"
)

func main() {
	linkedList := NewLinkedList(10)
	linkedList.Append(11)
	linkedList.Append(112)
	package main

	import (
	"container/list"
	"fmt"
	)

	type Node struct {
	Key int
	Left *Node
	package main

	import "fmt"

	func fibonacci(num int) int {
	if num == 0 {
	return 0
	}
	if num == 1 {
	return 1
	package main

	import "fmt"

	type Graph struct {
	vertices map[int][]int
	}

	func (g *Graph) AddVertice(vert int) {
	if g.vertices == nil {
	package main

	import "fmt"

	type Queue struct {
	Head *Node
	Tail *Node
	}

	type Node struct {
	package main

	import "fmt"

	type Stack struct {
	data []int
	}

	func (s *Stack) Push(element int) {
	s.data = append(s.data, element)