What is the worst case time complexity of delete operation(n is the no. of candidates)?

(a) O(1)

(b) O(n)

(c) O(log n)

(d) O(n log n)

My question is from Trees in division Trees of Data Structures & Algorithms I

The question was asked in class test.