The root points to its children, as in a binary tree.
It can be converted into the binary tree on the right.
One of the main reasons is that binary trees are easier to build.
The binary tree can be seen as several levels of nodes.
There are a variety of different operations that can be performed on binary trees.
Say we wanted to build a binary tree of integers.
The left and right subtree must each also be a binary search tree.
However, there are no restrictions on the shape of the underlying binary tree.
Let x be a node in a binary search tree.
In this case the decision tree model is a binary tree.