Binary Tree

In computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child, making it a k-ary tree with k equal to two. It can also be defined recursively and formally as a triple of a left subtree, a root node, and a right subtree, where each subtree is itself a binary tree or the empty set. Binary trees underlie many fundamental algorithms and data structures, including binary search trees and heaps.