/strong></span>: Inserts new_node into the tree before "pos".</p>
<p><span class="bold"><strong>Complexity</strong></span>: Constant-time.</p>
<p><span class="bold"><strong>Throws</strong></span>: Nothing.</p>
<p><span class="bold"><strong>Note</strong></span>: If "new_node" is greater than the lowest inserted key tree invariants are broken. This function is slightly faster than using "insert_before". </p>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">template</span><span clas