The CART algorithm produces only binary Trees: non-leaf nodes always have two children (i.e., questions only have yes/no answers).
On the contrary, other Tree algorithms such as ID3 can produce Decision Trees with nodes having more than two children.