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

L-3.13: Heap sort with Example | Heapify Method

Youtube
your image

Implementing Stack Using Array in Data Structures

Youtube
your image

MS Excel - Data Sorting

Youtube
your image

Side view of binary tree Algorithm(Left and right side view)

Youtube
your image

L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer

Youtube