Concurrent traversal of multiple binary trees

Abstract

In one embodiment, a tree traversal sequentially processes every level of two or more binary trees until reaching a leaf node for each the binary trees. Processing each level of the binary trees comprises: determining whether each traversed node of the remaining binary trees at the level is a non-leaf node or a leaf node; for the traversed leaf nodes at the level, remove the binary trees to which the leaf nodes belong from the remaining binary trees; and iteratively evaluating the traversed non-leaf nodes at the level of every n remaining binary trees until the non-leaf nodes at the level of all of the remaining binary trees are evaluated, where n≧2 and evaluating the non-leaf nodes of each n binary trees comprises concurrently evaluating the n non-leaf nodes of the n binary trees to determine to which one of the two child nodes of each of the n non-leaf nodes to traverse.