Below are a number of statements. You must indicate which of these is correct. A minheap is a kind of binary search tree

[answerhappygod]

Below are a number of statements. You must indicate which of
these is correct.
A minheap is a kind of binary search tree
Inserting a new element in a binary search tree has the time
complexity O (log2 n) in the worst case
Inserting a new element in a binary search tree has the time
complexity O (log2 n) at best
Inserting a new element in a red-black tree has the time complexity
O (log2 n) in the worst case
Inserting the numbers 16, 14, 20, 2 and 8 in turn in an empty BST
results in exactly the same BST as if we were instead inserting the
numbers 16, 14, 2, 20 and 8 in turn in an empty BST.
Binary search trees are always unique, ie. two different speech
sequences that contain the same number but in different order can
never result in the same BST.
Group of answer options
Only A, B, D and F are correct.
Only A, C, D and E are correct.
Only A, C, D and F are correct.
Only C, D and F are correct.
Only C, D and E are correct.