Implementing Binary Search Tree in Go.
A binary search tree is a binary tree in which every node fits a specific ordering property, i.e. left child <= current node < right child.
Example :
func main() {
A := binarytree.Node{Value: 7}
A.Insert(5)
A.InorderTraversal()
}