In a balanced binary search tree, adding an element always requires approximately O(log₂ n) steps.

Name: In a balanced binary search tree, adding an element always requires approximately O(log 2 n) steps.
Brand: Quizplus
Rating: 4.9 (35 reviews)

Question

Quizplus · Accepted Answer

Adding an element to a binary search tree requires as many steps as finding an element. Since adding finding an element in a balanced binary search tree always requires O(log₂ n) steps, adding an element does as well.

In a Balanced Binary Search Tree, Adding an Element Always