last-entry ( tree -- pair/f )
Binary search trees

Prev:	first-key ( tree -- key/f )
Next:	last-key ( tree -- key/f )

Vocabulary
trees

Inputs

tree

a tree

Outputs

pair/f

a pair or f

Word description
Returns a key-value mapping associated with the last (highest) key in this tree, or f if the tree is empty.

See also
first-key, first-entry, last-key

Definition

USING: kernel trees.private ;

IN: trees

: last-entry ( tree -- pair/f ) last-node [ node>entry ] ?call ;