What is the time complexity of the program to reverse stack when linked list is used for its implementation?
|B.||o(n log n)|
|Answer» A. o(n)|
|Explanation: as a linked list takes o(n) time for getting reversed thus linked list version of stack will also take the same time.|
Login to Continue
It will take less than 2 minutes