Abstract
A method for the balancing of binary search trees on a highly parallel computer is described. This method can be adapted for execution on a multiprocessor computer system. Copyright © 1974 by The Institute of Electrical and Electronics Engineers, Inc.