PA of Algorithms Q29
- Option : C
- Explanation :
Algo for concatenation is ⇒
{
t1 = S1 → nxt ;
t2 = S2 → nxt ;
t1 → nxt = S2
t2 → nxt = S1
S1 → nxt = t2
S2 → nxt = t1
}
it is sequential alqoni them so complexity is O(1)
Algo for concatenation is ⇒
{
t1 = S1 → nxt ;
t2 = S2 → nxt ;
t1 → nxt = S2
t2 → nxt = S1
S1 → nxt = t2
S2 → nxt = t1
}
it is sequential alqoni them so complexity is O(1)