Data Structures and Algorithms - Stacks

22. The postfix equivalent of the prefix * + a b - c d is

  • Option : A
  • Explanation : The tree whose preorder traversal yields * + A B – C D, is given in fig 6.18. Writer the post-order traversal of the tree. That is the postfix form.
Cancel reply
Cancel reply

25. Stack is useful for implemeting

  • Option : D
  • Explanation : Breadth-first search needs Queue for implementation
Cancel reply
Cancel reply