Trees where each node has at most two children, typically called left and right children. Binary trees enable efficient implementation of binary search trees and expression trees. Complete binary trees fill all levels except possibly the last, which fills left to right. Perfect binary trees have all leaves at the same depth.