Learn Data Structures and Algorithms with Golang

The main method

In the following code, the main method creates the binary search tree and inserts the elements 8, 3, 10, 1, and 6 into it. tree is printed by invoking the String method:

// main methodfunc main() { var tree *BinarySearchTree = &BinarySearchTree{} tree.InsertElement(8,8) tree.InsertElement(3,3) tree.InsertElement(10,10) tree.InsertElement(1,1) tree.InsertElement(6,6) tree.String()}

Run the following command to execute the binary_search_tree.go file:

go run binary_search_tree.go

The output is as follows:

The next section talks about AVL tree implementation.