thank you so much sir, thanks for providing so much of your time to make us understand. I a from Bangladesh struggling to learn discrete maths in the US, and I really appreciate your efforts :)
Q.No.2: Consider the following infix expression: (( A+B) * C - (D-E)) ^(F + G) Perform the following task for it; a) Construct a binary tree for it b) Write pre & post order traversal expression for the tree
Thank you so much.....amar khub help hoyeche ai video ta dea..!! I personally would thank u,....because this upcoming Data Structure exam would mean me a lot
its a great presentation but you confused me a bit on the Post Order i thought with the Post Order you have to keep : LEFT ,RIGHT & ROOT Please correct me if am wrong thanks
Robert Neal thanks. Write your voice or request in my site www.rdatta.com/You/YourVoice . Keep in touch with my site www.rdatta.com , www.f6build.com , www.di-ioc.com , www.codeffi.com and stay well.
Louis Jazz thanks. Write your voice or request in my site www.rdatta.com/You/YourVoice . Keep in touch with my site www.rdatta.com , www.f6build.com , www.di-ioc.com , www.codeffi.com and stay well.
If only lecturers could actually teach PROPERLY. Thank you for this video as it has answered all my questions.
I had a class for 2 hours and i didn`t completly understand it and these 15 minutes solved the problem
'If you can't explain it well , you do not understand it enough " . Awesome bro
YOU ARE 100 TIMES BETTER THAN MY PHD TEACHER.
* Your videos helped me pass my exam, thank u so much *
Finally someone made it Crystal Clear...Thank you Sir!
You explain it better than my teacher. Thank you
Thanks a lot to you, could not get nothing from professor.
Best I ever Found
First of all I have to congratulate your style of usage of Paint :) Secondly you explain it well. Thank you.
thank you so much sir, thanks for providing so much of your time to make us understand. I a from Bangladesh struggling to learn discrete maths in the US, and I really appreciate your efforts :)
Sir you're an absolute legend
Brilliant..now i can say understood the concept of binary search tree traversal clearly..thank you
fabulous...a lot of thanks... tomorrow is my exam... it will of great help...
Exactly what I am looking for. Thank you.
Q.No.2: Consider the following infix expression:
(( A+B) * C - (D-E)) ^(F + G)
Perform the following task for it;
a) Construct a binary tree for it
b) Write pre & post order traversal expression for the tree
You are awesome..Made it so simple for me to understand
vijay p Thank you. Keep in touch.
Thank you so much.....amar khub help hoyeche ai video ta dea..!!
I personally would thank u,....because this upcoming Data Structure exam would mean me a lot
Nice job man, this has helped me solve my question 9 of my assignment
Perfect explanation and visualization. Thanks
Such a great video and very nice conceptual understanding. Thanks so much
Explained well. Good job
Really awesome..... Thanks Ripon Datta
thanks Mr Ripon Datta
Thanks Man It was easy to understand
which mouse and keyboard do you use? I love the click of it !!!!
finally I understand what the Hell my prof wants me to do , thank you very much for the Vid ! :)
excellent video!!!!!!! thank you so much sir .....continue sharing many more such videos...
Man you r amazing. It helped me a lot ..😀😀😀😀😀
nice.....simple....easy to understand
thank you sir... its very easy way to understand ...
well explained , thank you so much . it helped me alot
its a great presentation but you confused me a bit on the Post Order i thought with the Post Order you have to keep : LEFT ,RIGHT & ROOT Please correct me if am wrong thanks
Thank for this video ..I could solve solve some problems from this video.. again thank you
very good explanation.
Really tq u sooo much sir i understand clearly😊😊
Nice explanation
Great Job Man >>>> Thank you so much
Perfectly explained :)
superb sir. thank you
excellent method ,now i have done
thanks man, i got an idea. i m from Zimbabwe
very simple.Thank u so much.
it made me to not open my notes :D very helpfull
i love you thnx so much you make it so easy
super explanation
all explained well but i can't understood you post-order traversal
Thanq very much sir I undersute now thanq sir
GBU easier than i thought
Thank you sir..
thank u very much it really helped me.............!!!!!!!!!!!!!
Thank you sir.
great video it really helped
Robert Neal thanks. Write your voice or request in my site www.rdatta.com/You/YourVoice . Keep in touch with my site www.rdatta.com , www.f6build.com , www.di-ioc.com , www.codeffi.com and stay well.
Excellent!
Thank you alot for the help!
Tq sir
You spelt postorder wrong on the right. hand side.
+Kaseyap see the good things, not the bad.
+Kaseyap this is not an english class
may God bless you ameen.
Great Video!
Louis Jazz thanks. Write your voice or request in my site www.rdatta.com/You/YourVoice . Keep in touch with my site www.rdatta.com , www.f6build.com , www.di-ioc.com , www.codeffi.com and stay well.
thank u
thanks sir
Thank you very much :)
bro can you help in this question: Find the value of Boolean expression represented as below by constructing a truth table: (x∧y) ∧ Z V (y∧¬Z)
thank you so much!! sir...
great video!
inorder arrange numbers in ascending order
thank you very hepful
very nice
thank you so much!!
Thank you so much!!!!!!!!
Easiest way!😇😇
Thank you !
Thanks you so much
Thank you.
good afternoon
You rock!
sir your post order explanation is wrong
thanks
tnx,,,
ubc cpsc 221
man thank u so much.so fcking good dude :))))))
Great ;P
nice'
time pass
thank you!
Easiest way!😇😇
Thanks