public V remove(K key) {

		RedBlackEntry<K, V> node = getNode(key);
		if (node == null) {
			return null;
		}
		V value = node.value;
		deleteEntry(node);
		return value;
	}
Removes the given key (first if duplicates are allowed) from the set.
@param key the key to remove from the set.
@return the value associated with the key removed or null if the key not found.
Ghidra/Framework/Generic/src/main/java/ghidra/util/datastruct/RedBlackTree.java