Which one of the following is the tightest upper bound that represent – McqOptions

MCQOPTIONS

1.	Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
A.	O(1)
B.	O(long)
C.	O(n)
D.	O(long)
Answer» D. O(long)

Discussion

No Comment Found

Related MCQs

What is Pass 2?
Which loader function is accomplished by loader?
The table created by lexical analysis to describe all literals used in the source program is?
A linker is given object module for a set of programs that were compiled separately. What is not true about an object module?
Software that measures, monitors, and controls events are ___________
Which of the following is true for machine language?
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
Dividing a project into segments and smaller units in order to simplify design and programming efforts is called?
In what module multiple instances of execution will yield the same result even if one instance has not terminated before the next one has begun?
The segment base is specified using the register named is?