public RedBlackNode<K,V> getFirst() {
        if (root == null) {
            return null;
        }
        RedBlackNode<K,V> node = root;

        while(node.left != null) {
            node = node.left;
        }
        return node;
    }
Returns the first entry in this set.
Ghidra/Framework/Generic/src/main/java/generic/stl/RedBlackTree.java