Introduction to tree algorithms | Graph Theory

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 YouTube:

Algorithms repository:

Video slides:

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

===================================

[Andrei-dsqv]

Best channel about Graphs and Algorithms, thanks a lot man!

[mzmzgreen]

Great as always, thank you for this!
Could you make a video about Gap List and Skip List? :)

[Knirin]

A dependency graph may be stored as a matrix to ease decency computation. This is a storage size algorithm time trade off.

[teetanrobotics]

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 ?

[kixievyoliztli]

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...

[mengyichen]

best graphed tree video I've seen ever

[yapril-e]

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)

[maheshguntumadugu]

Could you please suggest good resources for recursion and DP techniques

[johnbatchler]

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

[patryk_]

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.

[foxred]

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)

[joffreorellana]

No entiendo nada de ingles pero aqui estoy

[PatriceStoessel]

Your binary tree stored as a flattened array is also called a heap

[bullymaguire]

talk louder dude, ur volume is very low