algo

Documentation

Index

• type ComplexListNode
• type DoublyTreeNode
  • func NewDoublyTreeNode(data Object) *DoublyTreeNode
• type ListNode
• type Object
• type Stack
  • func NewStack() *Stack
  • func (s *Stack) Empty() bool
  • func (s *Stack) Len() int
  • func (s *Stack) Peak() interface{}
  • func (s *Stack) Pop() interface{}
  • func (s *Stack) Push(val interface{})
• type TreeNode
  • func NewTreeNode() *TreeNode

Types

type ComplexListNode

type ComplexListNode struct {
	Val     int
	Next    *ComplexListNode
	Sibling *ComplexListNode
}

type DoublyTreeNode

type DoublyTreeNode struct {
	Data       Object
	Father     *DoublyTreeNode
	LeftChild  *DoublyTreeNode
	RightChild *DoublyTreeNode
}

双向树

func NewDoublyTreeNode

func NewDoublyTreeNode(data Object) *DoublyTreeNode

type ListNode

type ListNode struct {
	Val  int
	Next *ListNode
}

type Object

type Object interface{}

type Stack

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

栈

基于container/list(链表)实现栈

func NewStack

func NewStack() *Stack

func (*Stack) Empty

func (s *Stack) Empty() bool

func (*Stack) Len

func (s *Stack) Len() int

func (*Stack) Peak

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

func (*Stack) Pop

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

func (*Stack) Push

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

type TreeNode

type TreeNode struct {
	Data       Object
	LeftChild  *TreeNode
	RightChild *TreeNode
}

func NewTreeNode

func NewTreeNode() *TreeNode