The difference between the binary tree and a binary search tree-03364
The difference between the binary tree and a binary search tree is that:
This multiple choice question (MCQ) is related to the book/course
vu cs301 Data Structures.
It can also be found in
vu cs301 Final Term - Quiz No.6.
The difference between the binary tree and a binary search tree is that:
a binary search tree has two children per node whereas a binary tree can have none, one, or twochildren per node
in binary search tree nodes are inserted based on the values they contain
in binary tree nodes are inserted based on the values they contain
none of these
