3.9 Evaluation of Prefix and Postfix expressions using stack | Data structures

Jenny's lectures CS/IT NET&JRF
Youtube
Related Topic
:- Data Structures

In this lecture I have described how we can evaluate prefix and postfix expressions efficiently using stack data structure. 

ORIGINAL Video

Comments

Related Posts

your image

Boundary traversal of binary tree (Border Elements)

Youtube
your image

Time-Space Trade Off Or Time-Memory Trade Off || Easiest Explanation || Hindi ||

Youtube
your image

3.1 Stack in data structure | Introduction to stack | data structures

Youtube
your image

Program for sorting Singly Linked List

Youtube
your image

Infix, Prefix and Postfix Expressions

Youtube