/li>
</ul>
</li>
</ul>
</li>
<li><p><em>breadth-first tree</em></p>
<ul>
<li><p>recursively print only at a particular level each time</p></li>
<li><p>create pointers to nodes on the right</p></li>
</ul>
</li>
<li><p><em>balanced tree</em>  = any 2 nodes differ in height by more than 1</p>
<ul>
<li><p>(maxDepth - minDepth) &lt;=1</p></li>
</ul>
</li>
<li><p><em>trie</em> is an infix of the word ‚Äúretrieval‚Äù because the trie can find a single word in a dictionary with only a prefix of the word</p>