avl

Documentation

Overview

Package avl is a Adelson-Velskii and Landis tree implemnation avl is self-balancing tree, i.e for all node in a tree, height difference between its left and right child will not exceed 1 more information : https://en.wikipedia.org/wiki/AVL_tree

Index

• func Delete(root **Node, key int)
• func Insert(root **Node, key int)
• type Node
  • func Get(root *Node, key int) *Node
  • func NewTree() *Node

Functions

func Delete

func Delete(root **Node, key int)

Delete : remove given key from the tree

func Insert

func Insert(root **Node, key int)

Insert a new item

Types

type Node

type Node struct {
	Key         int
	Height      int
	Left, Right *Node
}

Node of a tree

func Get

func Get(root *Node, key int) *Node

Get : return node with given key

func NewTree

func NewTree() *Node

NewTree create a new AVL tree