Complexity for the worst case running time for building a binary search tree is
Answers
Answered by
0
O(n²)
Explanation:
The worst case of binary tree is when it becomes a straight line that is it only has left trees / right trees , i.e elements added in ascending / descending order and every time an element is entered, the whole tree needs to be traversed. So n square. Pls mark it the brainliest if it helps
Similar questions