The difference between a binary tree and a binary search tree-03900
The difference between a binary tree and a binary search tree is that __________.
This multiple choice question (MCQ) is related to the book/course
vu cs302 Digital Logic Design.
It can also be found in
vu cs302 Mid Term - Quiz No.8.
The difference between a 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 two children 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
