Binary search trees in Go

Simple implementations of a binary search tree written in GoLang. For more information: basic

Installation

$>go get github.com/m2omou/go-binary-search-tree

import "github.com/m2omou/go-binary-search-tree"

Methods

insert(item)

Inserts the item into the tree. Returns true if inserted, false if duplicate.

remove(item)

Removes the item from the tree. Returns true if removed, false if not found.

size()

Number of nodes in the tree.

Exists()

Returns true if the key exists or return false.

showInOrder()

Print the tree in-order.

showPreOrder()

Print the tree pre-order.

showPostOrder()

Print the tree post-order.

Usage

  // Creating a binary search tree
	test := NewBst()

	// Inserting some data
	test.Insert(4)
	test.Insert(1)
	test.Insert(22)
	test.Insert(699)
	test.Insert(88)

	// Number of nodes in the tree
	fmt.Println(test.Size())

	// Removes the item from the tree. 
	// Returns true if removed, false if not found.
	test.Delete(4)

	// Returns true if the key exists or return false
	fmt.Println(test.Exists(4))
	fmt.Println(test.Exists(1))

Tree traversal

	// Print the tree in-order
	// Traverse the left sub-tree, root, right sub-tree
	showInOrder(test.root)

	// Print the tree pre-order
	// Traverse the root, left sub-tree, right sub-tree
	showPreOrder(test.root)

	// Print the tree post-order
	// Traverse left sub-tree, right sub-tree, root
	showPostOrder(test.root)