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

What is Data Science?

Youtube
your image

Memory Representation of linked list

Youtube
your image

Asymptotic Notations: Big O, Big Omega and Big Theta Explained (With Notes)

Youtube
your image

Data Structures & Algorithms: Which Programming Language to Use?

Youtube
your image

Remove Duplicates From Sorted Linked List

Youtube