suitable ds to reverse a string of characters

Question

Which of the following data structured is most efficient in terms of both space and time to reverse a string of characters?

• A. Linked list
• B. Stack
• C. Array
• D. Tree

Answer 1

Stack

Ex Given a string "abcde", Reverse the string

Take a character stack

Keep pushing the characters on the stack, so after all the characters are pushed the stack would look like this.

a

b

c

d

e

where top of stack is pointing to e

Now pop the stack  until its empty! :)