Question

7. Suppose we implement a stack using a singly linked list with head and tail pointers. What is the worst-case time complexity of the push and pop operations if we push and pop at the tail end of the list? Assume that we just have the head and tail pointers and we do not know the address of any other node in the linked list. Push() Worst-case time complexity? Reason? Push() Worst-case time complexity? Reason?

          7. Suppose we implement a stack using a singly linked list with head and
tail pointers. What is the worst-case time complexity of the push and
pop operations if we push and pop at the tail end of the list? Assume
that we just have the head and tail pointers and we do not know the
address of any other node in the linked list.
Push()
Worst-case time complexity?
Reason?
Push()
Worst-case time complexity?
Reason?

7. Suppose we implement a stack using a singly linked list with head and
tail pointers. What is the worst-case time complexity of the push and
pop operations if we push and pop at the tail end of the list? Assume
that we just have the head and tail pointers and we do not know the
address of any other node in the linked list.
Push()
Worst-case time complexity?
Reason?
Push()
Worst-case time complexity?
Reason?

Added by Karen B.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Nick Collins

Step 1

To push an element onto the stack at the tail end of the linked list, we would need to: Show more…

Show all steps

Thanks for your feedback!

Suppose we implement a stack using a singly linked list with head anc tail pointers. What is the worst-case time complexity of the push and pop operations if we push and pop at the tail end of the list? Assume that we just have the head and tail pointers and we do not know the address of any other node in the linked list: Push() Worst-case time complexity? Reason? Push() Worst-case time complexity? Reason?