StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
text
Body
copied!<p>Binary trees are data structures in which each node has at most two child nodes, called the <em>left child</em> and the <em>right child</em> of the node. Nodes with children are called <em>parent nodes</em>, the node without a parent is called the <em>root node</em>, while nodes with no children are called <em>leaf nodes</em>. The <em>level</em> of a node is how far it is below the root node; the <em>height</em> of a node is how far it is above the furthest leaf.</p> <p>One use of binary trees is efficient searching and sorting (e.g. binary search tree). The properties of trees mean nodes can be found quickly and compared easily, especially for trees which are <em>balanced</em>. (A tree is balanced if there is a similar number of right children as left children for each node.)</p> <p>Types of binary trees: </p> <ul> <li>Red/black trees</li> <li>Interval trees</li> <li>Binary search trees</li> <li>Segment trees</li> <li>AVL trees</li> <li>AA trees</li> <li>Splay trees</li> <li>Scapegoat trees</li> <li>Treap</li> </ul> <hr> <h3>Useful links</h3> <ul> <li><a href="http://en.wikipedia.org/wiki/Binary_tree" rel="nofollow noreferrer">Wikipedia entry</a></li> </ul> <hr> <h3>Related tags</h3> <ul> <li><a href="/questions/tagged/tree" class="post-tag" title="show questions tagged 'tree'" rel="tag">tree</a></li> <li><a href="/questions/tagged/data-structures" class="post-tag" title="show questions tagged 'data-structures'" rel="tag">data-structures</a></li> </ul>

Querying!

Guidance

An individual column

Larger individual text columns get their own page to allow for proper reading.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload