Application of Stacks (Infix to Postfix) - Part 1

preview_player
Показать описание
Data Structures: Application of Stacks (Infix to Postfix) - Part 1
Topics discussed:
1) Precedence of operators.
2) Infix expressions.
3) Finding the results of given infix expressions.
4) Dealing with the operators having the same priority.

Music:
Axol x Alex Skrindo - You [NCS Release]

#DataStructuresByNeso #DataStructures #Stacks #ApplicationOfStacks
Рекомендации по теме
Комментарии
Автор

Thanks to you very much for working on Discrete Maths and Data Structure together.

rajeshprajapati
Автор

1.15621
2.255
3.132861
4.48
5.5014.67
Ans

baliram
Автор

Neso Academy, i have been following your channel from so long.
So it makes me feel scared when I dont find my expected topic in your playlist.
So its my kind request to you to please continue to upload videos (DS), need not to be fast but definite, it will be of great help!!
Tysm😊

ashu
Автор

Sir please provide videos of queue, tree, and graphs soon

harshhs
Автор

Hi sir I'm following your videos on ds ... It's awesome and clearly understandable... If you add realtime examples for all types of ds it will be more helpful.... Like where these ds will be used... Thankyou sir

vipvip-upyb
Автор

Thank you so much sir...your videos has really helped in studies and I'm improving my programming skills as well.

susmitaroy
Автор

very happy because you uploaded 2 videos today. Repeat this daily. Uploaded 1 video on datastructures , discrete mathematics , c++, computer organisation , DBMS

monicabattacharya
Автор

thank you so much Neso <33 i really learned a lot of things from u sir,
please when you'll upload the videos of binary search trees

bouabahmed
Автор

thank you 😊 sir ☺. Please provide PPT'S for C language

monicabattacharya
Автор

Answer:

1. 15621
2. 255
3. 132861
4. 48
5. 15044/3

MdZishan-xucv
Автор

Sir thanks a lot for this series, please provide trees and graphs as soon possible.
Once again thank you so much sir.

abhisheknegi
Автор

Would compiler wont be required to build a parse tree for postfix expressions?

vikashdubey
Автор

1:-15, 621
2:-255
3:-1, 32, 861
4:-48
5:-5, 022.67

siddhikeshsonar
Автор

Sir Will you upload videos of tress and graphs ?

AryanSharma-quws
Автор

Sir please upload more video on BST or Avl tree

iqramukhtar
Автор

Thanks for video
1.15621
2.255
3.132861
4.48
5.5015

VallepuVasanthi
Автор

Thank you for all sir, can you please provide the lecture notes for the entire c lectures🙏

AnilKumar-bhdn
Автор

1. 15621
2.255
3.132, 861
4. 48
5.5014.67

shashinegative
Автор

1. 15621
2. 255
3. 132861
4. 48
5. 5015

BhumiKumari-ju
Автор

Answers
1) 15621
2) 255
3) 132861
4) 48
5) 15044/3

thanishqshaik
visit shbcf.ru