Binary Tree

Overview

A binary tree $T$ is a structure defined on a finite set of nodes that either

• contains no nodes, or
• is composed of three disjoint sets of nodes: a root node, a left subtree, and a right subtree.

The binary tree is a specialization of the k-ary tree.