CONSTRUCTION OF AN EXPRESSION TREE - DATA STRUCTURES

  Рет қаралды 51,637

Sundeep Saradhi Kanthety

Sundeep Saradhi Kanthety

Күн бұрын

Пікірлер: 38
@siddhantmusic5028
@siddhantmusic5028 5 жыл бұрын
Hey guyz that's not good u should appreciate...I found here 5k views but it has only 89 likes ...🙄🙄🙄at least u should give like for his hard wrk he is doing really Awsm thnku sir🙂🙂
@cyberversary262
@cyberversary262 4 жыл бұрын
Awesome work sir really hands off , you have a good concept .
@krishnamoorthysridhar8536
@krishnamoorthysridhar8536 Жыл бұрын
Excellent Explanation Sir. Very useful..
@rohankeshari6569
@rohankeshari6569 4 жыл бұрын
Well explained each steps. Thank You Sir for this Course.
@223nutanasrimaraka4
@223nutanasrimaraka4 3 жыл бұрын
I think, according to BODMAS, Division has a high priority than Multiplication. so I got ABCD/*+. Can any one justify?
@JSON-eo4kz
@JSON-eo4kz 2 жыл бұрын
Division and multiplication have same priority .
@AliHaider-jy1pr
@AliHaider-jy1pr 5 жыл бұрын
Sir please make a video on file handling in java by the way great work and easy to understand
@subhankarkaligithi3805
@subhankarkaligithi3805 5 жыл бұрын
Superrrrrr explanation sir your lectures are awesome
@hemanthnagidi3345
@hemanthnagidi3345 5 жыл бұрын
Sir videos on graphs kuda cheyandii
@sky-fly4067
@sky-fly4067 5 жыл бұрын
your teaching are nice
@breathmadrid9823
@breathmadrid9823 3 жыл бұрын
👍🏻
@taiwomicheal2788
@taiwomicheal2788 3 жыл бұрын
Well done sir, how can I get your videos that explains converting from tree to expression in postorder, inorder and pre-order
@wahajmohammed1956
@wahajmohammed1956 4 жыл бұрын
I would appreciate if anyone could answer this. At 16.50 min at particular example I'm little confused about POSTFIX converstion: Expression: A + B * C/D I'm expecting the POST FIX EXPRESSION: AB+CD/* But why it has to be ABC*D/+ .... Can anyone help me understand this ?
@RidwanurRahmanextreme
@RidwanurRahmanextreme 3 жыл бұрын
According to infix to postfix conversion schema -> operands get added to the postfix expression -> operators check some conditions first; if the stack is empty the character gets pushed into the stack, it not then it checks priority and that's a pretty lengthy explanation. In your case, I'm just pointing out one err -> till reading B your stack should be like this |+| (imagine it horizontally for now) after that when you read asterisk(*) it compares with the top of the stack, and if reading character has greater precedence then character at the top of the stack then that char gets pushed up in the stack. Now, the stack looks |+ *|, C now is another operand so it will definitely be added to the postfix expression, thus ABC... For better understandability I would recommend Sundeep sir's lecture on it, just scroll a bit higher from this playlist from here and keep learning 🙂
@SonaliSingh-5432
@SonaliSingh-5432 4 жыл бұрын
Sir last step m post fix ki jgh infix hoga
@anujsharma8938
@anujsharma8938 4 жыл бұрын
very well explained sir
@hrxhrx3947
@hrxhrx3947 2 жыл бұрын
Sir how you write expression in postfix???
@nackyding
@nackyding 4 жыл бұрын
Thank you!
@rmv2213
@rmv2213 4 жыл бұрын
👏👏👏👏🙏🙏
@smile-tk7yt
@smile-tk7yt 5 жыл бұрын
Thanks thanks thanks a lot sir
@vinothvk2711
@vinothvk2711 5 жыл бұрын
Bro while reading character starting itself operator comes wat to do Bro?
@cocoarecords
@cocoarecords 4 жыл бұрын
God bless Sundeep
@chiragbaghel8084
@chiragbaghel8084 5 жыл бұрын
Sir please check postfix expression is wrong
@ganeshbhat7613
@ganeshbhat7613 3 жыл бұрын
Gud....but i need code for this
@smile-tk7yt
@smile-tk7yt 5 жыл бұрын
AB+CD/* is the correct postfix expression
@-Anish
@-Anish 4 жыл бұрын
yes
@saikiranmaragouni1364
@saikiranmaragouni1364 3 жыл бұрын
No Check the rules once
@hrxhrx3947
@hrxhrx3947 2 жыл бұрын
@@saikiranmaragouni1364 bro what is rule please explain me
@sizzrizz6074
@sizzrizz6074 2 жыл бұрын
@@hrxhrx3947 1) lower priority operators(+,-) can tolerate higher priority operators(×,÷,^) Eg: you can keep +× but you have to pop × if it's ×+ 2) Two same priority operators can not tolerate each other. Eg: ×÷ in this you have to pop × before inserting ÷ Therefore the correct postfix answer for A+B*C/D will be ABC*D/+
@r.prabhakaraarjun6796
@r.prabhakaraarjun6796 Жыл бұрын
Sir kindly take my advice, I am not a experienced one but,ur videos are long and slow....U should speak fast and quick and speak precisely. This generation needs crisp concepts. Eventhough ur concept clarity is good,u won't reach a higher no of subscribers if this continues..... Kindly take my advice as a friend
@SanjuSanju-jl6xw
@SanjuSanju-jl6xw 2 жыл бұрын
Code sir
@saifshake7038
@saifshake7038 5 жыл бұрын
Post fix expression is wrong ABCD/*+
@sundeepsaradhi
@sundeepsaradhi 5 жыл бұрын
Hi Please let me know the correct one.
@saifshake7038
@saifshake7038 5 жыл бұрын
ABCD/*+
@smile-tk7yt
@smile-tk7yt 5 жыл бұрын
@@sundeepsaradhi AB+CD/* is the correct postfix expression sir
@jagadeeshmandala4097
@jagadeeshmandala4097 4 жыл бұрын
@@sundeepsaradhi ur correct sir
@durkeshkumaaranjevanandem4391
@durkeshkumaaranjevanandem4391 4 жыл бұрын
@@sundeepsaradhi ABC*D/+
BINARY TREE CONSTRUCTION WITH INORDER AND PREORDER TRAVERSALS - DATA STRUCTURES
9:01
TREE TERMINOLOGY - DATA STRUCTURES
30:12
Sundeep Saradhi Kanthety
Рет қаралды 97 М.
The IMPOSSIBLE Puzzle..
00:55
Stokes Twins
Рет қаралды 191 МЛН
I thought one thing and the truth is something else 😂
00:34
عائلة ابو رعد Abo Raad family
Рет қаралды 11 МЛН
Creative Justice at the Checkout: Bananas and Eggs Showdown #shorts
00:18
Fabiosa Best Lifehacks
Рет қаралды 26 МЛН
DSA26a - Expression Trees
12:27
EZCSE
Рет қаралды 16 М.
3.4 Infix Prefix and Postfix expressions | Data Structures Tutorials
14:14
Jenny's Lectures CS IT
Рет қаралды 1 МЛН
STACK APPLICATION : BALANCING SYMBOLS - DATA STRUCTURES
25:56
Sundeep Saradhi Kanthety
Рет қаралды 29 М.
Threaded Binary Tree (TBT) IN Data Structure Explaination
19:17
Vivekanand Khyade - Algorithm Every Day
Рет қаралды 204 М.
BINARY TREES AND TYPES OF BINARY TREE - DATA STRUCTURES
27:00
Sundeep Saradhi Kanthety
Рет қаралды 110 М.
3.12 Expression Trees | Binary Expression Tree | Data Structures Tutorials
13:17
Jenny's Lectures CS IT
Рет қаралды 677 М.
BINARY TREE REPRESENTATION - DATA STRUCTURES
17:12
Sundeep Saradhi Kanthety
Рет қаралды 70 М.
AVL Trees in Tamil | Data Structures and Algorithms CD3291 Lectures in Tamil
17:48
4G Silver Academy தமிழ்
Рет қаралды 106 М.
The IMPOSSIBLE Puzzle..
00:55
Stokes Twins
Рет қаралды 191 МЛН