INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |
-- Create node with `n' void children and item `v'.
-- Leftmost child
-- Item of active child
-- Left neighbor, if any
-- Right neighbor, if any
-- May items be removed?
-- Replace current child item with `v'
-- Add `v' to the left of current node.
-- Add `v' to the right of current node.
-- Make `n' the node's child.
-- Make `n' the node's child.
-- Make `other' the left sibling of current node.
-- Make `other' the right sibling of current node.
-- Remove active 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 |