Explanation:
Explanation: To keep the Last In First Out order, a stack can be implemented using linked list in two ways:
a) In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from beginning.
Answer:
b) stack
hope this helps
# you also keep smiling
Copyright © 2024 EHUB.TIPS team's - All rights reserved.
Answers & Comments
Explanation:
Explanation: To keep the Last In First Out order, a stack can be implemented using linked list in two ways:
a) In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from beginning.
Answer:
b) stack
hope this helps
# you also keep smiling