public RedBlackEntry<K, V> getEntryLessThanEqual(K key) {
		RedBlackEntry<K, V> bestNode = null;

		RedBlackEntry<K, V> node = root;
		while (node != null) {
			int result = key.compareTo(node.key);
			if (result == 0) {
				return node;
			}
			if (result < 0) {
				node = node.left;
			}
			else {
				bestNode = node;
				node = node.right;
			}

		}
		return bestNode;
	}
Returns the node with largest key in the set that is less or equal to the given key.
Returns null if there are no keys less than or equal to the given key.
@param key the search key
Ghidra/Framework/Generic/src/main/java/ghidra/util/datastruct/RedBlackTree.java