Answer & ExplanationAnswer: Option [C]
The tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes O(n)
In binary search tree to insert an object we first search the object from the root and always insert at the leaf.
For an unbalanced binary search tree all the nodes are required to traverse to insert as child after the last leaf.
So the required answer is O(n)
ADRE 2.0 Mock Test - 5 | Start Test |
ADRE 2.0 Mock Test - 5 | Start Test |
Government Schemes Mock Test | Start Test! |
Political Science Mock Test – 42 | Start Test |
History Test – 190 | Start Test |
Quantitative Aptitude Test | Start Test! |
Trigonometry - Mock Test | Start Test! |
Data Interpretation - Mock Test | Start Test! |
General Awareness - Mock Test | Start Test! |
Reasoning Ability - Mock Test | Start Test! |
Englist(Antonyms) Mock Test 1 | Start Test! |
Quantitative Aptitude (Percentage) Mock Test | Start Test! |
Economy Mock Test 1 | Unlock Test! |
Books & Authors - Test 2 | Unlock Test! |