Implement Important Data Structures in Go

[mubaris]

Data Structures to consider:

• Linked List
• Stack
• Queue
• Tree
• Graph
• Binary Search Tree
• Hash Table
• Heap
• Trie

[anandwana001]

@mubaris trying for stack, will do PR soon

[gauthamzz]

sounds good @anandwana001

[anandwana001]

@mubaris @gauthamzz I got busy with my exams but free now. Here I tried to make a stack in Go. please if you could give some feedback.

package main

import "fmt"

type Stack struct {
	size int
	top *Node
}

type Node struct {
	value string
	next *Node
}

func (s *Stack) Length() int {
  return s.size
}

func (s *Stack) Push(val string) {
	s.top = &Node{val, s.top}
	fmt.Printf("%v pushed to stack\n",val)
	s.size++
}

func (s *Stack) Pop() (val string) {
  if s.size > 0 {
    val, s.top = s.top.value, s.top.next
    s.size--
    return 
  }
  return
}

func main() {
	stack := &Stack{}
	
	stack.Push("10")
	stack.Push("20")
	stack.Push("30")
	
	fmt.Println()
	
	for stack.Length() > 0 {
		fmt.Printf("%s popped from stack\n", stack.Pop())
	}
}

[gauthamzz]

send pr ,it looks good

[pani-vishal]

Is this for everyone, if not can it be assigned to me?

[mubaris]

As of now only Stack and Queue are implemented.

Each Data Structure will get 10 points. If you would like to take this issue, Take Each DS one by one and comment you're working on it.

[pani-vishal]

Alright I would like to work on making a linked list.

[mubaris]

@falconis Sure

[ProBeta1]

May I work on Graph ?

[gauthamzz]

Yeah sure

[namantw]

Can I do the Binary Search tree?

[gauthamzz]

yea sure @namantw

[marshallKR7]

@mubaris @gauthamzz done Linked List implementation through PR #22

[arpitmisraw]

I want to work on heaps.