# Definition:Binary Tree

Jump to navigation
Jump to search

## 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).

### Branches

The branches at any particular node of a binary tree 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

This page may be the result of a refactoring operation.As such, the following source works, along with any process flow, will need to be reviewed. When this has been completed, the citation of that source work (if it is appropriate that it stay on this page) is to be placed above this message, into the usual chronological ordering.In particular: wrt branchesIf you have access to any of these works, then you are invited to review this list, and make any necessary corrections.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 `{{SourceReview}}` from the code. |

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