tailtree>alist(] ( from-key tree -- alist )
Binary search trees

Prev:	headtree>alist[] ( to-key tree -- alist )
Next:	tailtree>alist[] ( from-key tree -- alist )

Vocabulary
trees

Inputs

from-key	a key
tree	a tree

Outputs

alist

an array of key/value pairs

Word description
Returns an alist of the portion of this tree whose keys are strictly greater than to-key.

See also
headtree>alist[), headtree>alist[], tailtree>alist[], subtree>alist(), subtree>alist(], subtree>alist[), subtree>alist[]

Definition

USING: accessors make math.order trees.private ;

IN: trees

: tailtree>alist(] ( from-key tree -- alist )
    [ root>> [ after? ] (node>subalist-left) ] { } make ;