Which of the following operations of the binary search tree implementation of the ADT tree is O(n)?
A)insertion
B)deletion
C)retrieval
D)traversal

Question

Quizplus · Accepted Answer

Traversal of the binary search tree requires visiting each node in the tree in a specific order, such as in-order, pre-order, or post-order. Since visiting each node takes O(1) time and there are n nodes in the tree, traversal requires O(n) time, making it the only operation among the four choices that is O(n). Insertion, deletion, and retrieval in a balanced binary search tree take O(log n) time on average because the height of the tree is log n.

Which of the Following Operations of the Binary Search Tree