Question: In implementing the ADT List as a linked list that had the 2 object variables, firstNode and lastNode ; what would the time efficiency of
In implementing the ADT List as a linked list that had the 2 object variables, firstNode and lastNode ; what would the time efficiency of the add(T newentry) method be in Big O() terms, when adding a new data to end of list
a. Big O(log n)
b. Big O(1)
c. Big O( n )
d. Big O(n2)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
