INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |
-- Create a root node with value v
-- Value of left child
-- Value of right child
-- Left child
-- Right child
-- Child at cursor position
-- Current cursor position
-- Left neighbor, if any
-- Right neighbor, if any
-- Number of children
-- Is there no valid child position to the right of cursor?
-- Are there no children?
-- Has current node a left child?
-- Has current node a right child?
-- Has current node two children?
-- Set `left_child' to `n'.
-- Set `right_child' to `n'.
-- Put `v' at current child position.
-- Put `n' at current child position.
-- Move cursor to child remembered by `p'.
-- Move to first child.
-- Move cursor to last child.
-- Move cursor to next child.
-- Move cursor to previous child.
-- Move cursor to `i'-th child.
-- Copy of sub-tree beginning at cursor position and
-- having min (`n', `arity' - `child_index' + 1)
-- children.
INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |