Computer Sciences > Gate 2015 Set-3 > Stack

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

The result evaluating the postfix expression 10 5 + 60 6 / * 8 – is

A

284

B

213

C

142

D

71

Check Answer

Explanation

Correct : Stack

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science