|
SortedBinaryTrees.om |
PROCEDURE Insert(tree: Tree; object: Objects.Object); (* precondition: object must be acceptable for tree; inserts object into tree *) VAR found: BOOLEAN; parent, node: Node; BEGIN ASSERT(tree.comparable(object)); found := Find(tree, object, parent, node); ASSERT(~found); NEW(node); node.object := object; node.left := NIL; node.right := NIL; IF parent = NIL THEN tree.root := node; ELSIF tree.compare(object, parent.object) < 0 THEN parent.left := node; ELSE parent.right := node; END; END Insert; |
Copyright © 1999 Andreas Borchert, in HTML konvertiert am 29.06.1999 |