A text editor supports undo and redo operations. Which data structure is the most suitable to implement them?
- ATwo stacks
- BA single queue
- CA binary search tree
- DA hash table
Correct answer: A
A text editor supports undo and redo operations. Which data structure is the most suitable to implement them?