Method and/or system for tagging trees

1. A method of executing computer instructions on at least one computing device without further human interaction in which the at least one computing device includes at least one processor and at least one memory, the method comprising:

executing computer instructions on the at least one processor of the at least one computing device, the computer instructions having been stored on the at least one memory; and

storing in the at least one memory of the at least one computing device any results of having executed the computer instructions on the at least one processor of the at least one computing device;

wherein the computer instructions to be executed comprise instructions for identifying and traversing nodes in a complex tree hierarchy;

wherein the executing the identifying and traversing node computer instructions further comprises:

identifying a selected group of nodes for traversal of the complex tree hierarchy

for the selected group of nodes, attaching respective labeled edges and respective supporting nodes, wherein the labeled edges are to be labeled with specific content to indicate that a selected node of the selected group of nodes is to be traversed; and

attaching respective subtrees with edges labeled with the specific content, to the respective supporting nodes,

the respective subtrees to indicate a sequential numerical order of traversal for the selected group of nodes.

2. The method of claim 1 , wherein the respective subtrees of the complex tree hierarchy represent one or more values.

3. The method of claim 2 , wherein the one or more values comprise indices of a Q operation.

4. The method of claim 1 wherein the attached respective subtrees to comprise attached tags.

5. The method of claim 4 , wherein the executing the identifying and traversing node computer instructions further comprises: locating the selected group of nodes of a tree substructure of the complex tree hierarchy that correspond to the attached tags.

6. The method of claim 5 , wherein the complex tree hierarchy comprises a binary edge labeled tree.

7. The method of claim 6 , wherein the complex tree hierarchy comprises an ordered binary edge labeled tree.

8. The method of claim 5 , wherein the complex tree hierarchy comprises a binary node labeled tree.

9. The method of claim 8 , wherein the complex tree hierarchy comprises an ordered binary node labeled tree.

10. The method of claim 5 , wherein the complex tree hierarchy comprises an ordered edge labeled tree.

11. The method of claim 4 , wherein the attached tags are incorporated into the structure of the complex tree hierarchy via the computing device.

12. The method of claim 4 , wherein the identifying and traversing node computer instructions further comprise instructions for converting the complex tree hierarchy including the attached tags to or from a numerical representation with the attached tags specifying an order of traversal of the nodes selected for traversal.

13. The method of claim 1 , wherein the executing the identifying and traversing node computer instructions further comprises:

traversing the selected nodes in the sequential numerical order indicated by the attached respective subtrees.

14. The method of claim 13 , wherein the executing the identifying and traversing node computer instructions further comprises: locating the edges labeled with the specific content.

15. The method of claim 13 , wherein the attached respective subtrees of the complex tree hierarchy represent one or more values; and wherein the executing the identifying and traversing node computer instructions comprises: traversing the selected group of nodes in an order specified by the one or more values of the attached respective subtrees of the complex tree hierarchy.

16. The method of claim 15 , wherein the one or more values comprise the indices of a Q operation.

17. The method of claim 1 wherein the respective subtrees attached to the supporting nodes indicate an order of traversal by indicating specific positions in a sequence of nodes to be traversed.

18. An apparatus comprising:

at least one computing device;

the at least one computing device including at least one processor and at least one memory;

the at least one computing device to execute computer instructions on the at least one processor without further human interaction;

the computer instructions to be executed to have been stored on the at least one memory for execution on the at least one processor; and

the at least one computing device to store in the at least one memory of the at least one computing device any results to be generated from the execution on the at least one processor of the to be executed computer instructions;

the computer instructions to be executed to comprise instructions to identify and traverse a selected group of nodes of a complex tree hierarchy;

wherein the computer instructions to identify and traverse the selected group of nodes further comprise instructions to:

identify the selected group of nodes for traversal in the complex tree hierarchy;

for the selected group of nodes, attach respective labeled edges respective supporting nodes, wherein the labeled edges are labeled with specific content to indicate that a selected node is to be traversed; and

attach respective subtrees with edges labeled with the specific content, to the respective supporting nodes, the respective subtrees to indicate a sequential numerical order of traversal for the selected group of nodes.

19. The apparatus of claim 18 , wherein the respective subtrees of the complex tree hierarchy to represent one or more values.

20. The apparatus of claim 19 , wherein the one or more values to comprise indices of a Q operation.

21. The apparatus of claim 19 , wherein the computer instructions to identify and traverse the selected group of nodes further comprise instructions to traverse the selected group of nodes of the complex tree hierarchy in an order to be specified by the one or more values of the attached respective subtrees of the complex tree hierarchy.

22. The apparatus of claim 21 , wherein the one or more values to comprise indices of a Q operation.

23. The apparatus of claim 18 wherein the attached respective subtrees comprise attached tags.

24. The apparatus of claim 23 , wherein the computer instructions to identify and traverse the selected group of nodes further comprise instructions to locate selected group of nodes of a tree substructure of the complex tree hierarchy that are to correspond to the attached tags.

25. The apparatus of claim 24 , wherein the complex tree hierarchy to comprise an ordered edge labeled tree.

26. The apparatus of claim 24 , wherein the complex tree hierarchy to comprise a binary edge labeled tree.

27. The apparatus of claim 26 , wherein the complex tree hierarchy to comprise an ordered binary edge labeled tree.

28. The apparatus of claim 24 , wherein the complex tree hierarchy to comprise a binary node labeled tree.

29. The apparatus of claim 28 , wherein the complex tree hierarchy to comprise an ordered binary node labeled tree.

30. The apparatus of claim 23 , wherein the computer instructions to identify and traverse the selected group of nodes further comprise instructions to convert the complex tree hierarchy including the attached tags to or convert the complex tree hierarchy including the attached tags from a numerical representation with the attached tags to specify an order of traversal of the selected group of nodes.

31. The apparatus of claim 23 , wherein the computer instructions to identify and traverse the selected group of nodes further comprise instructions to incorporate the attached tags into the structure of the complex tree hierarchy.

32. The apparatus of claim 18 wherein the respective subtrees to be attached to the supporting nodes are to indicate an order of traversal by indication of specific positions in a sequence of nodes to be traversed.

33. The apparatus of claim 32 , wherein the computer instructions to identify and traverse the selected group of nodes further comprise instructions to locate edges labeled with the specific content.

34. The apparatus of claim 18 , wherein the computer instructions to identify and traverse the selected group of nodes further comprise instructions to traverse the selected group of nodes in the sequential numerical order indicated by the attached respective subtrees.