binarytree

Documentation

Index

• func AccessNodesByLayer(root *Node) [][]int
• func InOrder(n *Node)
• func LevelOrder(root *Node)
• func Max(a, b int) int
• func PostOrder(n *Node)
• func PreOrder(n *Node)
• type BTree
  • func (t *BTree) Depth() int
• type Node
  • func BstDelete(root *Node, val int) *Node
  • func InOrderSuccessor(root *Node) *Node
  • func Insert(root *Node, val int) *Node
  • func NewNode(val int) *Node

Functions

func AccessNodesByLayer

func AccessNodesByLayer(root *Node) [][]int

AccessNodesByLayer Function that access nodes layer by layer instead of printing the results as one line.

func InOrder

func InOrder(n *Node)

InOrder add's children to a node in order left first then right recursively

func LevelOrder

func LevelOrder(root *Node)

LevelOrder LevelOrder

func Max

func Max(a, b int) int

Max Function that returns max of two numbers - possibly already declared.

func PostOrder

func PostOrder(n *Node)

PostOrder PostOrder

func PreOrder

func PreOrder(n *Node)

PreOrder Preorder

Types

type BTree

type BTree struct {
	Root *Node
}

BTree Returns a binary tree structure which contains only a root Node

func (*BTree) Depth

func (t *BTree) Depth() int

Depth returns the calculated depth of a binary tree

type Node

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

Node structure for Nodes

func BstDelete

func BstDelete(root *Node, val int) *Node

BstDelete removes the node

func InOrderSuccessor

func InOrderSuccessor(root *Node) *Node

InOrderSuccessor Goes to the left

func Insert

func Insert(root *Node, val int) *Node

Insert a value in the BTree

func NewNode

func NewNode(val int) *Node

NewNode Returns a new pointer to an empty Node