GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

What is the worst case time complexity for search, insert and delete operations in a general Binary Search Tree?

A

O(n) for all

B

O(Logn) for all

C

O(Logn) for search and insert, and O(n) for delete

D

O(Logn) for search, and O(n) for insert and delete

asked in trees, binary search trees, binary heaps by gate

2 Answers

0 votes
A

O(n) for all
answered by gate
0 votes
o(n) for all
answered by surodeep dy

Related questions

The best answer to any question