help site: http:--nova.umuc.edu-~jarc-idsv-lesson1.html Check out my website and like or comment any other tutorials you would like to see! www.applejuicescholars.com
I just had to logged in to say this... Thank you SO MUCH for the 3 videos pre,in and post. these help me so much and I will have a final exam tmr . but thanks to you. these save much time to study other topics. Thanks again :)
+Kunlaya Ko Thanks for the support my watching the video. I love logging in and seeing the good and negative comments. I may remake these videos with some better quality soon.
The funny thing is, this stuff is actually really easy when taught properly. When my professor tried to teach us this in class it felt like we were trying to decipher Egyptian Hieroglyphics.
thank you so much for explaining this! i totally spaced out when the teacher was explaining this and i'm glad there are youtube videos to explain stuff when you space out in class lol
+Adam Nelson So the recursive function is just less code and easier to understand. As a rule any recursive function can be rewritten as a procedural and visa versa. Almost all functions that deal with trees are recursive because the height of the tree could be infinite and the recursive base case is pretty easy (when you find a NULL or empty branch). Now, you could go down the tree with a simple while loop (EX: while(tree.child != NULL)) but it would take more code to set the sibling to the new root and so recursion is preferred. I hope that makes sense.
This way of explaining it was genius! Watched preorder-, inorder- and postorder traversal once and will never forget it.
I watched all three of your tree traversal videos. You gave excellent examples and explanations.
All the three traversal videos are amazing just by watching the in -order I figured it all out before completing the last two. Thanks
I just had to logged in to say this...
Thank you SO MUCH for the 3 videos pre,in and post. these help me so much and I will have a final exam tmr . but thanks to you. these save much time to study other topics. Thanks again :)
+Kunlaya Ko Ditto. You couldn't have explained these any better. My final is tomorrow at 8am, and this was sooooo clutch. You da real MVP, AJ.
ikr I wish I could someday support or pay half of my tuition to these youtubers tutor online haha
+Kunlaya Ko Thanks for the support my watching the video. I love logging in and seeing the good and negative comments. I may remake these videos with some better quality soon.
All 3 of the videos were great. Thank you! It really helped me out with my class.
+SNReloaded Thanks. Good luck with your classes.
Yup. Final is due tomorrow and that is what I am working on now. I plan to come back to your channel if I need any help with anything in the future.
Let me know if you need anything in the future!
my lecturer never even talked about these methods! this makes it simple to understand!
Explained very very well, easy to understand if said like this, thanks alot
Thanks a lot, much more better than my lecturer
the simplest way in understanding Binary Search Tree......great works mate....
Probably best youtube videos for these 3 algorithms
I have an exam that will likely include this tomorrow - this method was a great help, thank you!
The funny thing is, this stuff is actually really easy when taught properly. When my professor tried to teach us this in class it felt like we were trying to decipher Egyptian Hieroglyphics.
Great and straight forward explanation. Thanks!
+Montana Wong Thank you man
All three videos are great! Good work!
Now I have these memorized. Thanks!
two thumbs way up man - this is such an easy way to remember it.
awesome video. couldn't understand it from my textbook, but your explanation makes it clear
Thanks for the videos on tree traversals.
Amazing video! Crystal clear! Thanks so much!
Great explanation! Very helpful. Thank you.
thank you so much for explaining this! i totally spaced out when the teacher was explaining this and i'm glad there are youtube videos to explain stuff when you space out in class lol
Thank you so much! These videos were amazing
Very easy to understand :) Well done.
Thank you !! for your teaching. It's good explanations.
This was extremely helpful. Thank AJ!
***** Your welcome Angus! Let me know how I can improve!
very good acronym to remember, thanks
thanks for these videos! very well explained.
Awesome video! Ty!
You deserve more views mate, every single other video I watched was made by guys speaking some form of broken english.
Thank you man!
simple explanations
Thank you!!
Great vids, can you tell me why these are usually implemented as recursive functions?
+Adam Nelson So the recursive function is just less code and easier to understand. As a rule any recursive function can be rewritten as a procedural and visa versa. Almost all functions
that deal with trees are recursive because the height of the tree could be infinite and the recursive base case is pretty easy (when you find a NULL or empty branch). Now, you could go down the tree with a simple while loop (EX: while(tree.child != NULL)) but it would take more code to set the sibling to the new root and so recursion is preferred. I hope that makes sense.
Very helpful! Thank you!
Please do you have a video of using Inorder + any orders to get a Tree traversals?
thank you sir
Hey MAn you are owsum u explained it very clearly i like the way u explain :) thanks man God Bless U
Good Work!!!
Hello, videos are good, but the link you provided is not working. There seems to be some JS error in the console, that says lesson1 not defined.
Thanks helped a lot
in 12 node cant be right node less than parent-node ?
Thanks!
i have a test in the afternoon just reading the slides get me nowhere thankyou !
Yes the exampels are graet !
Thanks, that realy helped me. : 3
thank you
thanks very good
really really thnk you
great videos thank you!
+Metalwrath i saw you in a tycho comment thread before lol
Freddy Acevedo yes i commented on album of tycho lol
nice.
thnx
thanks alot man :)
Bravooo
you should do avl trees. :c
what's gucci
Bravooo
Thanks!