What is the worst case time complexity of insertion operation(n =no. of candidates)?
A. O(1)
B. O(n)
C. O(log n)
D. O(n log n)
Answer: Option A
This Question Belongs to Data Structure >> Trees In Data Structures
Related Questions on Trees in Data Structures
A. Inorder
B. Preorder
C. Postorder
D. Level-order
Join The Discussion