Answer:
answer : 0 (n log n )
Explanation:
Creating an AVL tree containing the same values and containing N integers and without destroying the original BST in the process, the worst case time will be : 0 ( n log n ) and this is because each insertion will take 0 (log n ) time
The worst case time for a binary search algorithm that contain N integers without destroying the original binary search tree (BST) is [tex]0(NlogN)[/tex]
Binary search can be defined as an efficient algorithm that is designed and developed for searching an element from a sorted list of data, especially by using the run-time complexity of [tex]0(logN)[/tex].
Note: N is the total number of elements contained in a list.
In this scenario, the worst case time for this binary search algorithm that contain N integers without destroying the original binary search tree (BST) is given by [tex]0(NlogN)[/tex]
Read more on binary search here: https://brainly.com/question/24268720
