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

3.6 Infix to Postfix using stack | Data structures

Youtube
your image

Swap nodes pairwise in Linked List (nodes in pairs)

Youtube
your image

Sorting Algorithms++ Ep03: Tree Sort

Youtube
your image

Segregate 0's, 1's and 2's together in an array[O(n)](Dutch National Flag Problem)

Youtube
your image

L-3.8: Introduction to Heap Tree with examples | Max Min Heap

Youtube