Our binary search trees do not allow duplicate elements.Group of answer choicesTrueFalse

Every binary tree is also a binary search treeGroup of answer choicesTrueFalse

A hash table is always faster than a binary search tree for searching elements.Group of answer choicesTrueFals

A binary tree can be implemented using an array.Group of answer choicesTrueFalse

In a binary search tree, balancing is essential to give O(log n) time for search. Group of answer choicesTrueFalse

Which of the following is NOT a common binary tree operation?Group of answer choicesSearchSortingInsertionDeletion