// Maximum return the maximum key node in the red-black tree
// return key and payload
Maximum return the maximum key node in the red-black tree
return key and payload
// Maximum return the maximum key node in the red - black tree // return key and payload
func (rb RBTree) Maximum() (int, interface{}, error) {
	if rb.Empty() {
		return 0, nil, fmt.Errorf("empty tree")
	}
	node := rb.maximumNode(rb.root)
	return node.key, node.payload, nil
}
func ( rb RBTree ) Maximum ( ) ( int , interface { } , error ) { if rb . Empty ( ) { return 0 , nil , fmt . Errorf ( " " ) } node := rb . maximumNode ( rb . root ) return node . key , node . payload , nil }
Maximum return the maximum key node in the red-black tree
return key and payload
Maximum return the maximum key node in the red - black tree return key and payload