Question: WHICH OPTION THE COREET ONE 10-Given a linear linked list L composed of n nodes. The algorithm InsLast( L, val) inserts a new node with
WHICH OPTION THE COREET ONE
10-Given a linear linked list L composed of n nodes. The algorithm InsLast( L, val) inserts a new node with value val as last node of L. What is the complexity time of InsLast (L, val) by using of big O notation? 1. O(1) 2. O(n) 3. O(n2) 4. O(log(n)) 5. O(2n) 6. None of the above
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
