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

A hash table is an array-based data structure Group of answer choicesTrueFalse

Our binary search trees do not allow duplicate elements.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 true about hash tables?Group of answer choicesThey are not suitable for implementing dictionaries or associative arrays.They are efficient for searching, insertion, and deletion.They guarantee constant time operations for all operations.They are sorted data structures

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