Introduction to tree algorithms | Graph Theory
ฝัง
- เผยแพร่เมื่อ 22 พ.ค. 2024
- An introduction to tree algorithms. This video covers how trees are stored and represented on a computer.
Support me by purchasing the full graph theory course on Udemy which includes additional problems, exercises and quizzes not available on TH-cam:
www.udemy.com/course/graph-th...
Algorithms repository:
github.com/williamfiset/algor...
Video slides:
github.com/williamfiset/Algor...
0:00 Introduction
3:08 Representing trees on a computer
4:48 Rooted trees
5:28 Binary trees
6:06 Binary search trees
7:05 Storing rooted trees
===================================
Practicing for interviews? I have used, and recommend `Cracking the Coding Interview` which got me a job at Google. Link on Amazon: amzn.to/3cvMof5
A lot of the content on this channel is inspired by the book `Competitive Programming` by Steven Halim which I frequently use as a resource and reference. Link on Amazon: amzn.to/3wC2nix
Best channel about Graphs and Algorithms, thanks a lot man!
Awesome Explanation! Thank you so much!!!!!!!!!!!
Great as always, thank you for this!
Could you make a video about Gap List and Skip List? :)
Excellent effort
Thank you! Great video!! ;)
Great video.
thanks a lot for the video
A dependency graph may be stored as a matrix to ease decency computation. This is a storage size algorithm time trade off.
1thanks for another great video!!!!
Hey William Fiset, big fan of you and channel. I wanted to cover everything in your channel from beginner to advanced. Could you please tell me the order in which I should watch the playlists ?
I try and organize my playlist videos in topological order so that you don't end up watching a video that requires you to watch another video as a prerequisite. After that condition is met then the videos are mostly sorted from easiest to hardest :)
@@WilliamFiset-videos 😑 u cud've used everyday English
best graphed tree video I've seen ever
Magnificent.
Maybe I'm wrong, please let me know if is it so, but for the list shown in (3:42 min) , for "(2, 3) ," should not be the other way around, I mean = "(3, 2) ," thanks in advance for the explanation...
I use trees to solve problems in electronic or anything needs to help solve problems I use it for possible outcomes mainly if it's 1 to 4 possible outcomes and one must be correct then u solve problems
Does anybody can help me with this algorithm? How can I determine(compare) if the shortest path tree is arise from presented graph. For linear time. Tree and graph presented as adjacency List with costs. (graph can be negative cycled)
Could you please suggest good resources for recursion and DP techniques
FaadCoder channel
@@rockrocks8840 theres no chennel by that name, when i searcged i got paras saini coding channel. is it the same?
thanks.
OMG this is sooooooo greaaaaaaaat
What font do you use?
This looks like a "Menlo" - default mac os font
I disagree that you should avoid adjacency matrix.
For up to 64 nodes it acually takes less space, than the array.
Besides that there are many sitiation where you care much more about the access time than memory consumption.
I agree that for small trees using a matrix is something worth considering, however the issue is that it doesn't scale well which is why I tend to avoid them.
At 6:10 you pronounced the correct definition of BST
But displayed not correct definition (I mean it's weaker than BST)
Unless x.left.value doesn't mean value of the left node (which would be very strange)
No entiendo nada de ingles pero aqui estoy
Your binary tree stored as a flattened array is also called a heap
en.wikipedia.org/wiki/Heap_(data_structure)
No, I wouldn't say that. A heap implies an ordering on the tree. You can use the flattening technique generally, not just for heaps.
@@WilliamFiset-videos I see, you're right
Thanks
Interns 😭😭
talk louder dude , ur volume is very low