tree

Documentation

Index

• type BinaryTree
  • func NewBinaryTree() *BinaryTree
  • func (t *BinaryTree) Delete(data Element)
  • func (t *BinaryTree) InOrderTraversal(node *Node, q *queue.LinkQueue)
  • func (t *BinaryTree) Insert(data Element) bool
  • func (t *BinaryTree) LevelTraversal(node *Node, q *queue.LinkQueue)
  • func (t *BinaryTree) Max() Element
  • func (t *BinaryTree) Min() Element
  • func (t *BinaryTree) PostOrderTraversal(node *Node, q *queue.LinkQueue)
  • func (t *BinaryTree) PreOrderTraversal(node *Node, q *queue.LinkQueue)
  • func (t *BinaryTree) String() string
• type Element
• type Node

Types

type BinaryTree

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

func NewBinaryTree

func NewBinaryTree() *BinaryTree

func (*BinaryTree) Delete

func (t *BinaryTree) Delete(data Element)

func (*BinaryTree) InOrderTraversal

func (t *BinaryTree) InOrderTraversal(node *Node, q *queue.LinkQueue)

func (*BinaryTree) Insert

func (t *BinaryTree) Insert(data Element) bool

func (*BinaryTree) LevelTraversal

func (t *BinaryTree) LevelTraversal(node *Node, q *queue.LinkQueue)

func (*BinaryTree) Max

func (t *BinaryTree) Max() Element

func (*BinaryTree) Min

func (t *BinaryTree) Min() Element

func (*BinaryTree) PostOrderTraversal

func (t *BinaryTree) PostOrderTraversal(node *Node, q *queue.LinkQueue)

func (*BinaryTree) PreOrderTraversal

func (t *BinaryTree) PreOrderTraversal(node *Node, q *queue.LinkQueue)

func (*BinaryTree) String

func (t *BinaryTree) String() string

type Element

type Element interface {
	Less(e Element) bool
	String() string
}

type Node

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