Last time I checked Worst case was big oh not big theta
Examiner has given theta notation to confuse students
But, remember that we have to find worst case
forget the notation
in worst case, BST can be either left or right skewed
Worst case input to the algorithm would be Increasing order or decreasing order of elements.
Hence
linear line complexity in both insertion and deletion
THanks