..:: Stacks on Data Structure and Algorithms related Questions and Answers

Stacks on Data Structure and Algorithms related Questions and Answers

Question : What is the time complexity of evaluation of postfix expression algorithm?
1. O (N)
2. O (N log N)
3. O (N²)
4. O (M log N)
Answer : 1 - O (N)

* Be the First to Post a Comment.

Submit comment :

Ask Question

Note : Name and Email never shown.

Other Questions

Practice Paper sets

Stacks on Data Structure and Algorithms related Questions and Answers

Submit comment :

Ask Question

JagSchool of Transformative Skills

PDPM Indian Institute of Information Technology Design Manufacturing

Global Institute Of Technology & Management

Institute for future education Entrepreneurship and leadership

Other Questions

Practice Paper sets

Stacks on Data Structure and Algorithms related Questions and Answers

Submit comment :

Ask Question

Subscribe