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

Prev:	height ( tree -- n )
Next:	first-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 first (lowest) key in this tree, or f if the tree is empty.

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

Definition

USING: kernel trees.private ;

IN: trees

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