1. A method of treating data within a labeled tree structure, the method comprising: inputting data in a labeled tree structure; transforming the data into two coordinated arrays; and using the transformed data to one selected from a group consisting of compressed storage, compressed transmission, and compressed indexing, wherein said labeled tree structure comprises: a plurality of nodes and edges that define a parent-child relationship, comprising rightmost child nodes, and node labels at said nodes, wherein said step of transforming the data into two coordinated arrays comprises: creating a first array that is a list of binary digits comprised of a first binary value and a second binary value, and creating a second array that is a list of said node labels, wherein said first and second binary values of said first array are coordinated to node labels of said second array to form respective couples, in such a way that, for each of said couples, a binary value of said first array is coupled to a node label of said second array that occupies a same position; and wherein, for each of said couples, labels of said second array of said rightmost child nodes of said labeled tree structure are coupled to said first binary value, and all the other nodes of said second array are coupled to said second binary value.