BinaryTree.go

package main

import "sync"

type BinaryTreeData interface {
	Less(element BinaryTreeData) bool
}

type BinaryTreeNode struct {
	Data  BinaryTreeData
	Left  *BinaryTreeNode
	Right *BinaryTreeNode
}

type BinaryTree struct {
	root *BinaryTreeNode
	lock sync.RWMutex
}

func NewBinaryTree() *BinaryTree {
	return &BinaryTree{}
}

func (bt *BinaryTree) Insert(data BinaryTreeData) {
	bt.lock.Lock()
	defer bt.lock.Unlock()
	n := &BinaryTreeNode{data, nil, nil}
	if bt.root == nil {
		bt.root = n
	} else {
		insertNode(bt.root, n)
	}
}

func insertNode(node *BinaryTreeNode, newNode *BinaryTreeNode) {
	if newNode.Data.Less(node.Data) {
	}
}

func (bt *BinaryTree) Traversal() BinaryTreeData {
}