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

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