binarytree
A binary tree is a tree data structure in which each node has at most two children, commonly referred to as the left and right child. It is defined recursively: a binary tree is either empty or a node that contains data and two binary trees as its left and right subtrees.
Each node stores a value and references to its children. The top node is called the root.
Variations include full binary trees (every node has 0 or 2 children), complete binary trees (all levels
Common operations for binary trees include insertion, deletion, and search (varies by tree type). Traversal methods
Applications span data organization, coding and decoding schemes, expression evaluation, priority queues, and implementations of algorithms