The binary tree is an a recursive data structure. A tree is composed of a root node, and each node has two potential child nodes. Here, each node is an active object, allowing large data structures to be distributed aver the network.
@author ProActive Team @version 1.0, 2001/10/23 @since ProActive 0.7