easy5 pts · first answer countsstacks-and-queues

Data structure behind Undo

An invoice editor needs Undo. Which structure fits best for storing past actions?

A.A stack, so the latest action is undone firstB.A queue, so the oldest action is undone firstC.A heap, so the biggest change is undone firstD.A hash map keyed by action name

Discussion 0

Join free to post in the discussion.

Data structure behind Undo

Discussion 0

Related questions