Data Structures · Question 16 · Easy
Data Structures question 16
Which data structure is the most natural choice for implementing the Undo feature of a text editor, where the most recent change must be reversed first?
- Stack
- Queue
- Hash table
- Binary search tree
Answer and explanation
Answer: A. Stack
Explanation: Undo must reverse the latest action first, which is Last-In-First-Out behaviour, so each edit is pushed on a stack and Undo pops it.
Previous: Two stacks share a single array arr[0..n-1]. Stack 1 starts at index 0 and… · Next: What is the time complexity of inserting a new node at the beginning (head) of…
Practise data structures
Try a fresh set of data structures questions with an explanation after every answer, free and without signing up: Data Structures practice. Or sit a full placement mock test.
More data structures questions
- The keys 10, 4, 7, 1 are inserted in that order into an empty array-based…
- How many structurally different binary trees can be formed with exactly 3 nodes?
- Two stacks share a single array arr[0..n-1]. Stack 1 starts at index 0 and…
- What is the time complexity of inserting a new node at the beginning (head) of…
- A data structure allows insertion and deletion at both the front and the rear…
- A tree data structure has 25 nodes. How many edges does it have?
- Which of the following is a non-linear data structure?
- The keys 45, 20, 60, 10, 30, 25, 50 are inserted in that order into an empty…
- What is the prefix (Polish) form of the infix expression (A + B) * (C - D) ?
- The keys 12, 22, 35, 42, 55, 7, 17 are inserted into a hash table of size 10…
More technical & programming practice
Algorithms · Object-Oriented Programming · DBMS · SQL · Operating Systems · Computer Networks · Software Engineering · Cloud & DevOps
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge