InfinityUtils/RedBlackTree.h
Node* maximum(Node* node) {
		while (node->right != TNULL) {
			node = node->right;
		}
		return node;
	}
// find the node with the maximum key

find the node with the maximum key
find the node with the maximum key
Node* maximum(Node* node) {
		while (node->right != TNULL) {
			node = node->right;
		}
		return node;
	}
Node * maximum ( Node * node ) { while ( node -> right != TNULL ) { node = node -> right ; } return node ; }
find the node with the maximum key
find the node with the maximum key