(A) A binary search tree has two children per node whereas a binary tree can have none, one, or two children per node
(B) In binary search tree nodes are inserted based on the values they contain
(C) In binary tree nodes are inserted based on the values they contain
(D) None of the above
»Important Links:
English Mcqs | General Knowledge Mcqs | Pak Studies Mcqs |
Current Affairs Mcqs | Current Affairs Mcqs PDF | Current Affairs of Pakistan |
Books PDF | Notes PDF | Islamic Studies Mcqs |