The difference between a binary tree and a binary search tree-03596
The difference between a binary tree and a binary search tree is that, a binary search tree has __________.
This multiple choice question (MCQ) is related to the book/course
vu cs301 Data Structures.
It can also be found in
vu cs301 Mid Term - Quiz No.9.
The difference between a binary tree and a binary search tree is that, a binary search tree has __________.
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
two children per node whereas a binary tree can have none, one, or two children per node
none of these
