1. A method of generating a tree structure comprising processing nodes for data processing, wherein each of the processing nodes of the tree structure represents a processor unit in a processor network, the method comprising: providing a first pair of trees including an even tree A 0 employed to perform even-numbered computation steps in a sequence of steps and an odd tree A 1 employed to perform odd-numbered computation steps in the sequence of steps, each tree of the first pair having the same leaf node a and no parent node; providing a second pair of trees wherein each of the trees in the second pair of trees is different than each of the trees in the first pair of trees, the second pair of trees including an even tree B 0 employed to perform even-numbered computation steps in the sequence of steps and an odd tree B 1 employed to perform odd-numbered computation steps in the sequence of steps, each tree of the second pair having the same leaf node b and no parent node; and creating the tree structure comprising the processing nodes for improved concurrent processing of the sequence of steps by re-ordering the processing nodes in the first and second pairs of trees as follows: generating a first node x for use as a parent node in the tree structure; creating a first binary tree X 0 by combining the even tree A 0 of the first pair of trees and the odd tree B 1 of the second pair of trees and incorporating the first node x as a parent node of the first binary tree X 0 ; and creating a second binary tree X 1 by combining the odd tree A 1 of the first pair of trees and the even tree B 0 of the second pair of trees and elevating the leaf node b of the second pair of trees to become a parent node of the second binary tree X 1 .