INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |
-- Create single node with item `v'.
-- Does tree contain a node whose item
-- is equal to `v' (object comparison)?
-- Minimum item in tree
-- Maximum item in tree
-- Is tree sorted?
-- Operation on node item,
-- to be defined by descendant classes.
-- Here it is defined as an empty operation.
-- Redefine this procedure in descendant classes if useful
-- operations are to be performed during traversals.
-- Apply `node_action' to every node's item
-- in tree, using pre-order.
-- Apply node_action to every node's item
-- in tree, using infix order.
-- Apply node_action to every node's item
-- in tree, using post-order.
-- Put `v' at proper position in tree
-- (unless `v' exists already).
-- (Reference or object equality,
-- based on `object_comparison'.)
-- Sort tree.
--| Uses heapsort.
--| The reason for the `external sort' is that
--| the insertion order in the tree will ensure
--| it is balanced
INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |