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 said tree and three reference arrays, wherein each entry in said data array corresponds to a given node in said tree and includes three pointers, with each of said three pointers pointing to a respective one of said three reference arrays, wherein a first one of said pointers identifies a parent node of said given node, a second one of said pointers identifies a first child node of said given node, and a third one of said pointers identifies a sibling node of said given node; determining partial workloads from the linear array structure; and performing parallel processing of said partial workloads.