Patent ID: 8078642

Claim:
A method comprising: accessing, by one or more computer systems, m binary trees, m denoting an integer greater than or equal to 2, the m binary trees each comprising one or more non-leaf nodes, two or more leaf nodes, and one or more levels, the non-leaf nodes of each of the m binary trees comprising one root node and zero or more intermediate nodes, for each of the m binary trees, the non-leaf nodes each having two child nodes, the intermediate nodes and the leaf nodes each having one parent node, and the levels each comprising one or more of the non-leaf or leaf nodes; and sequentially processing, by the one or more computer systems, every one of the levels of the m binary trees until reaching a leaf node for each the m binary trees, processing each one of the levels of the m binary trees comprising: determining whether one or more traversed nodes of one or more remaining of the m binary trees at the level are each a non-leaf node or a leaf node, the remaining binary trees each having one of its non-leaf or leaf nodes at the level as one of the traversed nodes, the traversed nodes at the level each being the root node of one of the m binary trees or having been determined as a result of evaluating its parent node; for the traversed leaf nodes at the level, removing the binary trees to which the traversed leaf nodes belong from the remaining binary trees; and iteratively evaluating the traversed non-leaf nodes at the level of every n of the remaining binary trees until the non-leaf nodes at the level of all of the remaining binary trees are evaluated, n denoting an integer greater than or equal to 2, evaluating the traversed non-leaf nodes of each n binary trees comprising concurrently evaluating the n traversed non-leaf nodes of the n binary trees to determine to which one of the two child nodes of each of the n traversed non-leaf nodes to traverse.