last-key ( tree -- key/f )
Binary search trees

Prev:	last-entry ( tree -- pair/f )
Next:	headtree>alist[) ( to-key tree -- alist )

Vocabulary
trees

Inputs

tree

a tree

Outputs

key/f

a key or f

Word description
Returns the last (highest) key in this tree, or f if the tree is empty.

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

Definition

USING: accessors kernel trees.private ;

IN: trees

: last-key ( tree -- key/f ) last-node dup [ key>> ] when ;