<span class="searchmatch">search</span> <span class="searchmatch">tree</span> (plural <span class="searchmatch">search</span> <span class="searchmatch">trees</span>) (computing theory) A <span class="searchmatch">tree</span> (data structure) set up to facilitate searching. The red-black <span class="searchmatch">tree</span> is a balanced binary search...
generalised <span class="searchmatch">search</span> <span class="searchmatch">tree</span> generalized <span class="searchmatch">search</span> <span class="searchmatch">tree</span> (plural generalized <span class="searchmatch">search</span> <span class="searchmatch">trees</span>) (databases) A type of <span class="searchmatch">search</span> <span class="searchmatch">tree</span> that features data and query extensibility...
<span class="searchmatch">search</span> <span class="searchmatch">trees</span> plural of <span class="searchmatch">search</span> <span class="searchmatch">tree</span>...
generalized <span class="searchmatch">search</span> <span class="searchmatch">trees</span> plural of generalized <span class="searchmatch">search</span> <span class="searchmatch">tree</span>...
has an article on: splay <span class="searchmatch">tree</span> Wikipedia splay <span class="searchmatch">tree</span> (plural splay <span class="searchmatch">trees</span>) (computing theory) A self-balancing binary <span class="searchmatch">search</span> <span class="searchmatch">tree</span> with the additional property...
nodes in diagrams of such <span class="searchmatch">trees</span>. red-black <span class="searchmatch">tree</span> (plural red-black <span class="searchmatch">trees</span>) (computing) A type of self-balancing binary <span class="searchmatch">search</span> <span class="searchmatch">tree</span>, typically used to implement...
structure. AVL <span class="searchmatch">tree</span> (plural AVL <span class="searchmatch">trees</span>) English Wikipedia has an article on: AVL <span class="searchmatch">tree</span> Wikipedia (computer science) A self-balancing binary <span class="searchmatch">search</span> <span class="searchmatch">tree</span>, where,...
body cavity <span class="searchmatch">search</span> breadth-first <span class="searchmatch">search</span> cavity <span class="searchmatch">search</span> consent <span class="searchmatch">search</span> depth-first <span class="searchmatch">search</span> fingertip <span class="searchmatch">search</span> generalized <span class="searchmatch">search</span> <span class="searchmatch">tree</span> global <span class="searchmatch">search</span> and replace...
pruning a <span class="searchmatch">search</span> <span class="searchmatch">tree</span> by eliminating any branch that is demonstrably inferior to a branch previously encountered. algorithm for pruning a <span class="searchmatch">search</span> <span class="searchmatch">tree</span> by eliminating...
árvore rubro-negra f (plural árvores rubro-negras) (computing) red-black <span class="searchmatch">tree</span> (binary <span class="searchmatch">search</span> <span class="searchmatch">tree</span>)...