The difference between a binary tree and a binary search tree is that?

(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

Merge sort makes two recursive calls. Which statement is true after these recursive calls finish, but before the merge step?

(A) Elements in the first half of the array are less than or equal to elements in the second half of the array
(B) The array elements form a heap
(C) Elements in the second half of the array are less than or equal to elements in the first half of the array
(D) None of the above

error: Content is protected !!