// Minimum return the minimum key node in the binary search tree
// return key and payload
Minimum return the minimum key node in the binary search tree
return key and payload
// Minimum return the minimum key node in the binary search tree // return key and payload
func (b BinarySearchTree) Minimum() (int, interface{}, error) {
	if b.Empty() {
		return 0, nil, fmt.Errorf("empty tree")
	}
	node := minimumNode(b.root)
	return node.key, node.payload, nil
}
func ( b BinarySearchTree ) Minimum ( ) ( int , interface { } , error ) { if b . Empty ( ) { return 0 , nil , fmt . Errorf ( " " ) } node := minimumNode ( b . root ) return node . key , node . payload , nil }
Minimum return the minimum key node in the binary search tree
return key and payload
Minimum return the minimum key node in the binary search tree return key and payload