When maintaining a sorted list using a binary search tree, the search operation computing time is O(1), whereas the insertion operation takes O(log2N) time.Group of answer choicesTrueFalse

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

What is the average time complexity for searching an element in a binary search tree?Group of answer choicesO(1)O(n)O(log n)Depends on the tree structure

The efficiency of the Insertion Sort is O(N2) where N is the size of the list being sorted.Group of answer choicesTrueFalse

When a binary search tree is balanced, it provides search, addition, and removal operations that have O(N2) computing time.Group of answer choicesTrueFalse

What is the worst-case time complexity of searching for an element in a balanced binary search tree in the worst case?Group of answer choicesO(1)O(n^2)O(n)O(log n)