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 :)
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
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
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
First of all I have to congratulate your style of usage of Paint :) Secondly you explain it well. Thank you.
Thanks a lot to you, could not get nothing from professor.
Best I ever Found
Brilliant..now i can say understood the concept of binary search tree traversal clearly..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 :)
fabulous...a lot of thanks... tomorrow is my exam... it will of great help...
Sir you're an absolute legend
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
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
Nice job man, this has helped me solve my question 9 of my assignment
You are awesome..Made it so simple for me to understand
vijay p Thank you. Keep in touch.
Exactly what I am looking for. Thank you.
Perfect explanation and visualization. Thanks
Such a great video and very nice conceptual understanding. Thanks so much
excellent video!!!!!!! thank you so much sir .....continue sharing many more such videos...
finally I understand what the Hell my prof wants me to do , thank you very much for the Vid ! :)
Explained well. Good job
Really awesome..... Thanks Ripon Datta
thank you sir... its very easy way to understand ...
Man you r amazing. It helped me a lot ..😀😀😀😀😀
which mouse and keyboard do you use? I love the click of it !!!!
Thank for this video ..I could solve solve some problems from this video.. again thank you
Thanks Man It was easy to understand
Really tq u sooo much sir i understand clearly😊😊
nice.....simple....easy to understand
well explained , thank you so much . it helped me alot
Thank you for your efforts
thanks Mr Ripon Datta
thanks man, i got an idea. i m from Zimbabwe
excellent method ,now i have done
very simple.Thank u so much.
very good explanation.
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
Perfectly explained :)
superb sir. thank you
it made me to not open my notes :D very helpfull
Great Job Man >>>> Thank you so much
thank u
Nice explanation
i love you thnx so much you make it so easy
all explained well but i can't understood you post-order traversal
thank u very much it really helped me.............!!!!!!!!!!!!!
super explanation
Thanq very much sir I undersute now thanq 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.
Thank you alot for the help!
inorder arrange numbers in ascending order
Thank you sir.
Thank you sir..
Thank you very much :)
thank you so much!! sir...
Excellent!
You spelt postorder wrong on the right. hand side.
+Kaseyap see the good things, not the bad.
+Kaseyap this is not an english class
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 you so much!!!!!!!!
thank you so much!!
thank you very hepful
great video!
Thank you !
Thanks you so much
GBU easier than i thought
thanks sir
Thank you.
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)
very nice
may God bless you ameen.
Tq sir
Easiest way!😇😇
You rock!
tnx,,,
thanks
man thank u so much.so fcking good dude :))))))
ubc cpsc 221
Great ;P
sir your post order explanation is wrong
nice'
good afternoon
time pass
thank you!
Thanks
Easiest way!😇😇