Typos to be corrected with next errata

docs/odata-data-aggregation-ext/odata-data-aggregation-ext.html

@@ -2836,7 +2836,7 @@ <h3 id="621-transformations-ancestors-and-descendants"><a name="Transformationsa
 <span id="cb110-15"><a href="#cb110-15" aria-hidden="true" tabindex="-1"></a><span class="fu">}</span></span></code></pre></div>
 </div>
 <h3 id="622-transformation-traverse"><a name="Transformationtraverse" href="#Transformationtraverse">6.2.2 Transformation <code>traverse</code></a></h3>
-<p>The traverse transformation returns instances of the input set that are or are related to nodes of a given recursive hierarchy in a specified tree order.</p>
+<p>The <code>traverse</code> transformation returns instances of the input set that are or are related to nodes of a given recursive hierarchy in a specified tree order.</p>
 <p><span class="math inline">\(H\)</span>, <span class="math inline">\(Q\)</span> and <span class="math inline">\(p\)</span> are the first three parameters defined <a href="#CommonParametersforHierarchicalTransformations">above</a>.</p>
 <p>The fourth parameter <span class="math inline">\(h\)</span> of the <code>traverse</code> transformation is either <code>preorder</code> or <code>postorder</code>. <span class="math inline">\(S\)</span> is an optional fifth parameter as defined <a href="#CommonParametersforHierarchicalTransformations">above</a>. Let <span class="math inline">\(H&#39;\)</span> be the output set of the transformation sequence <span class="math inline">\(S\)</span> applied to <span class="math inline">\(H\)</span>, or let <span class="math inline">\(H&#39;\)</span> be the collection of root nodes in the recursive hierarchy <span class="math inline">\((H,Q)\)</span> if <span class="math inline">\(S\)</span> is not specified. Nodes in <span class="math inline">\(H&#39;\)</span> are called start nodes in this subsection (see <a href="#weight">example 117</a>).</p>
 <p>All following parameters are optional and form a list <span class="math inline">\(o\)</span> of expressions that could also be passed as a <code>$orderby</code> system query option. If <span class="math inline">\(o\)</span> is present, the transformation <a href="#SamenessandOrder">stable-sorts</a> <span class="math inline">\(H&#39;\)</span> by <span class="math inline">\(o\)</span>.</p>

docs/odata-data-aggregation-ext/odata-data-aggregation-ext.md

@@ -2809,7 +2809,7 @@ results in
 
 ### <a name="Transformationtraverse" href="#Transformationtraverse">6.2.2 Transformation `traverse`</a>
 
-The traverse transformation returns instances of the input set that are or are related to nodes of a given recursive hierarchy in a specified tree order.
+The `traverse` transformation returns instances of the input set that are or are related to nodes of a given recursive hierarchy in a specified tree order.
 
 $H$, $Q$ and $p$ are the first three parameters defined [above](#CommonParametersforHierarchicalTransformations).
 

odata-data-aggregation-ext/6 Hierarchical Transformations.md

@@ -179,7 +179,7 @@ results in
 
 ### ##subsubsec Transformation `traverse`
 
-The traverse transformation returns instances of the input set that are or are related to nodes of a given recursive hierarchy in a specified tree order.
+The `traverse` transformation returns instances of the input set that are or are related to nodes of a given recursive hierarchy in a specified tree order.
 
 $H$, $Q$ and $p$ are the first three parameters defined [above](#CommonParametersforHierarchicalTransformations).