A Common-Sense Guide to Data Structures and Algorithms

A binary tree is a tree that abides by the following rules: • Each node has either zero, one, or two children. • If a node has two children, it must have one child that has a lesser value than the parent, and one child that has a greater value than the parent.