PA of Algorithms Q29

29The concatenation of two lists is to be performed in O(1) time. Which of the following implementations of a list should be used?

Option : C
Explanation :

Algo for concatenation is ⇒
{
t₁ = S₁ → nxt ;
t₂ = S₂ → nxt ;
t₁ → nxt = S₂
t₂ → nxt = S₁
S₁ → nxt = t₂
S₂ → nxt = t₁
}
it is sequential alqoni them so complexity is O(1)

Forgot your password?

I agree with the Terms.