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

        while(node.right != null) {
            node = node.right;
        }
        return node;

    }
Returns the last entry in this set.
Ghidra/Framework/Generic/src/main/java/generic/stl/RedBlackTree.java