chapter8

Documentation

Index

• func BSTSortedOrder(root *BST) []int
• func BinaryTreeLevelOrder(root *BST) [][]int
• func SearchPostingsListIterative(head *PostingsListElement)
• func SearchPostingsListRecursive(head *PostingsListElement)
• func SlidingWindow(t []TrafficElement, w int) []int
• func StackSorting(st *IntStack)
• func TowerHanoi(n int)
• type BST
• type IntStack
  • func ViewSunset(hs []int) IntStack
  • func (st *IntStack) Pop() (int, error)
  • func (st *IntStack) Push(n int)
• type PostingsListElement
• type PostingsListElementStack
  • func (st *PostingsListElementStack) Pop() (*PostingsListElement, error)
  • func (st *PostingsListElementStack) Push(x *PostingsListElement)
• type QueueWithMax
  • func NewQueueWithMax() *QueueWithMax
  • func (qwm *QueueWithMax) Dequeue() (int, error)
  • func (qwm *QueueWithMax) Enqueue(n int)
  • func (qwm *QueueWithMax) Max() (int, error)
• type Stack
  • func (st *Stack) Pop() (*BST, error)
  • func (st *Stack) Push(x *BST)
• type StackWithMax
  • func (s *StackWithMax) Max() (int, error)
  • func (s *StackWithMax) Pop() (int, error)
  • func (s *StackWithMax) Push(x int)
• type StackedQueue
  • func NewStackedQueue() *StackedQueue
  • func (sq *StackedQueue) Dequeue() (int, error)
  • func (sq *StackedQueue) Enqueue(n int)
• type TrafficElement

Functions

func BSTSortedOrder

func BSTSortedOrder(root *BST) []int

func BinaryTreeLevelOrder

func BinaryTreeLevelOrder(root *BST) [][]int

func SearchPostingsListIterative

func SearchPostingsListIterative(head *PostingsListElement)

func SearchPostingsListRecursive

func SearchPostingsListRecursive(head *PostingsListElement)

func SlidingWindow

func SlidingWindow(t []TrafficElement, w int) []int

func StackSorting

func StackSorting(st *IntStack)

func TowerHanoi

func TowerHanoi(n int)

Types

type BST

type BST struct {
	Value int
	Left  *BST
	Right *BST
}

type IntStack

type IntStack []int

func ViewSunset

func ViewSunset(hs []int) IntStack

func (*IntStack) Pop

func (st *IntStack) Pop() (int, error)

func (*IntStack) Push

func (st *IntStack) Push(n int)

type PostingsListElement

type PostingsListElement struct {
	Value int
	Order int
	Next  *PostingsListElement
	Jump  *PostingsListElement
}

type PostingsListElementStack

type PostingsListElementStack []*PostingsListElement

func (*PostingsListElementStack) Pop

func (st *PostingsListElementStack) Pop() (*PostingsListElement, error)

func (*PostingsListElementStack) Push

func (st *PostingsListElementStack) Push(x *PostingsListElement)

type QueueWithMax

type QueueWithMax struct {
	// contains filtered or unexported fields
}

func NewQueueWithMax

func NewQueueWithMax() *QueueWithMax

func (*QueueWithMax) Dequeue

func (qwm *QueueWithMax) Dequeue() (int, error)

func (*QueueWithMax) Enqueue

func (qwm *QueueWithMax) Enqueue(n int)

func (*QueueWithMax) Max

func (qwm *QueueWithMax) Max() (int, error)

type Stack

type Stack []*BST

func (*Stack) Pop

func (st *Stack) Pop() (*BST, error)

func (*Stack) Push

func (st *Stack) Push(x *BST)

type StackWithMax

type StackWithMax struct {
	// contains filtered or unexported fields
}

func (*StackWithMax) Max

func (s *StackWithMax) Max() (int, error)

func (*StackWithMax) Pop

func (s *StackWithMax) Pop() (int, error)

func (*StackWithMax) Push

func (s *StackWithMax) Push(x int)

type StackedQueue

type StackedQueue struct {
	// contains filtered or unexported fields
}

func NewStackedQueue

func NewStackedQueue() *StackedQueue

func (*StackedQueue) Dequeue

func (sq *StackedQueue) Dequeue() (int, error)

func (*StackedQueue) Enqueue

func (sq *StackedQueue) Enqueue(n int)

type TrafficElement

type TrafficElement struct {
	// contains filtered or unexported fields
}