Adding an element to a balanced binary search tree takes ____ time. A)O(log (n)) B)O(1) C)O(n²) D)O(n)

Name: Adding an element to a balanced binary search tree takes ____ time. A)O(log (n)) B)O(1) C)O(n 2 ) D)O(n)
Brand: Quizplus
Rating: 4.9 (33 reviews)

Question

Quizplus · Accepted Answer

Adding an element to a balanced binary search tree takes O(log (n)) time as the tree is balanced, hence the height is log(n) and the time complexity of insertion in a binary search tree is proportional to the height of the tree. Therefore, the best choice is option A.

Adding an Element to a Balanced Binary Search Tree Takes