gods

Documentation

Index

• Variables
• func List2Ints(head *ListNode) []int
• type Heap
  • func (h *Heap) Extract() int
  • func (h *Heap) HeapifyDown(index int)
  • func (h *Heap) HeapifyUp(index int)
  • func (h *Heap) Insert(key int)
• type LinkedList
  • func (l *LinkedList) Append(n *ListNode)
  • func (l *LinkedList) Delete(position int) bool
  • func (l *LinkedList) DeleteWithValue(value int)
  • func (l *LinkedList) Insert(n *ListNode, position int) bool
  • func (l *LinkedList) Prepend(n *ListNode)
  • func (l LinkedList) PrintListVal()
• type ListNode
  • func Ints2List(nums []int) *ListNode
• type NaryNode
  • func Ints2NaryNode(nodes []int) *NaryNode
• type Stack
  • func (s *Stack) IsEmpty() bool
  • func (s *Stack) Peek() interface{}
  • func (s *Stack) Pop() interface{}
  • func (s *Stack) Push(item interface{})
  • func (s *Stack) Size() int
• type TreeNode
  • func Ints2TreeNode(ints []int) *TreeNode
  • func (t *TreeNode) Delete(val int)
  • func (t *TreeNode) Insert(val int)
  • func (t *TreeNode) Search(val int) bool

Variables

var Null = -1 << 63

Functions

func List2Ints

func List2Ints(head *ListNode) []int

Types

type Heap

type Heap struct {
	Array []int
}

func (*Heap) Extract

func (h *Heap) Extract() int

Extract returns the largest key, and removes it from the heap.

func (*Heap) HeapifyDown

func (h *Heap) HeapifyDown(index int)

HeapifyDown will be heapify top to bottom

func (*Heap) HeapifyUp

func (h *Heap) HeapifyUp(index int)

HeapifyUp will heapify from bottom top

func (*Heap) Insert

func (h *Heap) Insert(key int)

Insert adds an element to the heap

type LinkedList

type LinkedList struct {
	Head   *ListNode
	Length int
}

func (*LinkedList) Append

func (l *LinkedList) Append(n *ListNode)

func (*LinkedList) Delete

func (l *LinkedList) Delete(position int) bool

func (*LinkedList) DeleteWithValue

func (l *LinkedList) DeleteWithValue(value int)

func (*LinkedList) Insert

func (l *LinkedList) Insert(n *ListNode, position int) bool

func (*LinkedList) Prepend

func (l *LinkedList) Prepend(n *ListNode)

func (LinkedList) PrintListVal

func (l LinkedList) PrintListVal()

type ListNode

type ListNode struct {
	Val  int
	Next *ListNode
}

func Ints2List

func Ints2List(nums []int) *ListNode

type NaryNode

type NaryNode struct {
	Val      int
	Children []*NaryNode
}

func Ints2NaryNode

func Ints2NaryNode(nodes []int) *NaryNode

type Stack

type Stack struct {
	Items []interface{}
}

func (*Stack) IsEmpty

func (s *Stack) IsEmpty() bool

func (*Stack) Peek

func (s *Stack) Peek() interface{}

func (*Stack) Pop

func (s *Stack) Pop() interface{}

func (*Stack) Push

func (s *Stack) Push(item interface{})

func (*Stack) Size

func (s *Stack) Size() int

type TreeNode

type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}

func Ints2TreeNode

func Ints2TreeNode(ints []int) *TreeNode

Source: halfrost

func (*TreeNode) Delete

func (t *TreeNode) Delete(val int)

func (*TreeNode) Insert

func (t *TreeNode) Insert(val int)

func (*TreeNode) Search

func (t *TreeNode) Search(val int) bool