Handbook
Glossary
pop-tree-left ( tree -- node/f )
Binary search trees
Prev:
ceiling-entry ( key tree -- pair/f )
Next:
pop-tree-right ( tree -- node/f )
Vocabulary
trees
Inputs
tree
a
tree
Outputs
node/f
a
pair
or
f
Word description
Removes and returns a key-value mapping associated with the lowest key in this map, or
f
if the map is empty.
See also
pop-tree-right
Definition
USING:
kernel
trees.private
;
IN:
trees
:
pop-tree-left
( tree -- node/f )
dup
first-node
pop-tree-extremity
;