rsively and should not be used in production contract code. Binary search tree: left child &lt; root &lt; right child Red violation: red node cannot have red child Black violation: each side of a node (path from root to all leaves) must have equal black tree height.</p></div><dl><dt><span class="label-parameters">Parameters:</span></dt><dd><div><code>_self</code> - TreeMap.Map</div><div><code>_root</code> - TreeMap.Entry</div></dd><dt><span class="label-return">Returns:</span></dt><dd>red-black tree black h