Such traversals are classified by the order in which the vertices are visited. Common tree manipulations and traversals are supported via the codice 9 and codice 10 objects. Such traversals are classified by the order in which the nodes are visited. Some performance may be gained if the tree avoids unnecessary traversals. The gates are defended by traversals and redoubts and the Ramparts. The number of pointer traversals is decreased by one for most cases. Relationship traversals are performed as joins on these tables. Traversals are the key to the power of applying operations to scene graphs.