1. A method for parallel processing of data organized in the form of a tree, the method comprising: converting the tree into a linear array structure including a data array for storing the data of the tree and three reference arrays, wherein each entry in the data array corresponds to a given node in the tree and includes three pointers, with each of the three pointers pointing to a respective one of the three reference arrays, wherein a first one of the pointers identifies a parent node of the given node, a second one of the pointers identifies a first child node of the given node, and a third one of the pointers identifies a sibling node of the given node; determining partial workloads from the linear array structure; and performing parallel processing of the partial workloads.