Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

structs

package

Go to main page

Versions in this module

v1

v1.0.2

May 9, 2021

v1.0.1

May 3, 2021

v1.0.0

May 3, 2021

Changes in this version

+ var ErrPopEmptyQueue = errors.New("queue is empty")

+ var ErrPopEmptyStack = errors.New("stack is empty")

+ type StringQueue struct

+ func (q *StringQueue) Clear()

+ func (q *StringQueue) IsEmpty() bool

+ func (q *StringQueue) IsNotEmpty() bool

+ func (q *StringQueue) Pop() (string, error)

+ func (q *StringQueue) PopAllAndClear() []string

+ func (q *StringQueue) Push(value string)

+ type StringStack struct

+ func (s *StringStack) IsEmpty() bool

+ func (s *StringStack) IsNotEmpty() bool

+ func (s *StringStack) IsTopEqual(val string) bool

+ func (s *StringStack) Pop() (string, error)

+ func (s *StringStack) Push(value string)

+ func (s *StringStack) Top() (string, error)

+ type Tree struct

+ func NewTree(value interface{}, left, right *Tree) *Tree

+ func (t *Tree) GetValue() interface{}

+ func (t *Tree) LeftChild() *Tree

+ func (t *Tree) RightChild() *Tree

+ type TreeStack struct

+ func (s *TreeStack) Pop() (*Tree, error)

+ func (s *TreeStack) Push(value *Tree)