Definition:Binary Tree

From ProofWiki
Jump to navigation Jump to search


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 of a binary tree are frequently called the left-hand branch and the right-hand branch, and a distinction is made between them.


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