Question

what is the time complexity of the BST construction with a list n elements​

Answer 1

Explanation:

Worst Case-

In worst case, The binary search tree is a skewed binary search tree. Height of the binary search tree becomes n. So, Time complexity of BST Operations = O(n).

Answer 2

Answer:

Worst Case-

In worst case, The binary search tree is a skewed binary search tree. Height of the binary search tree becomes n. So, Time complexity of BST Operations = O(n).