(btree) A tree in which each node has at most two successors

or child nodes. In Haskell this could be represented as