A binary tree has at most two children per node; a binary search tree keeps smaller values on the left and larger on the right.