Definition:Binary Tree

This page has been identified as a candidate for refactoring. Separate out the definitions of left-hand branch and right-hand branch. Until this has been finished, please leave {{Refactor}} in the code. New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only. Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Refactor}} from the code.

Definition

A binary tree is a rooted tree which has at most two branches at any node.

That is, every node in a binary tree has (apart from the root) degree of either $1$ (for the leaf nodes) or $3$ (one for the parent, two for the children).

The branches at any particular node are frequently called the left-hand branch and the right-hand branch, and a distinction is made between them.

Applications

Binary trees are frequently used in computer science to store data in an efficiently searchable fashion.

Sources

• 2014: Christopher Clapham and James Nicholson: The Concise Oxford Dictionary of Mathematics (5th ed.) ... (previous) ... (next): Entry: binary tree