puneeth8994 / binary-tree-go-impl Goto Github PK

// To keep binary tree ordered, it is required for data to
// conform to Comparable interface, so data container node location
// can be identified
type Comparable interface {
	Less(dataOther Comparable) bool
}

// Struct for holding Data, that can be a pointer or just a data type
// Also holds left and right children pointers
type Node struct {
	// Reference to data contained in the node, should conform to Comparable interface
	Data  *Comparable // pointer to Comparable
	// Reference to the left child node in binary search tree
	Left  *Node
	// Reference to the right child node in binary search tree
	Right *Node
}

type TestBSTData struct {
	row []string
}

func NewTestBSTData(row []string) *TestBSTData {
	return &TestBSTData{row}
}

func (d TestBSTData) Less(other Comparable) bool {
	return d.row[0] < dOther.row[0]
}