Can we represent a tree with an array? - Inside code

[@maneeshgupta2448]

I wish this channel explains all the standard algorithms

[@VietnamSteven]

This is an fantastic presentation!

[@sampathsubasinghe929]

Awesome explanations, keep up the good job, dude !

[@free-palestine000]

great explanation. please do more

[@JulioDx3480]

This is really helpful, thank you.

[@insidecode]

You're welcome!

[@ngneerin]

Beautiful animation

[@elshaterhassansaber7644]

Great vid as usual❤️❤️❤️

[@insidecode]

Thanks!

[@TadesseDev]

But this is going to work only for a binary tree, right. Or we might need another way of calculating the nod relationships.

[@insidecode]

Yes for binary trees only, but we can have the same logic a general k-ary tree, we just adapt the formula to find children and parent

[@ngneerin]

One way to do is
tree = [ root, [ [ node, [ ], [ node, [ ] ] ] ]

[@subee128]

Thanks

[@AjithKumaR-jw9wt]

Bro pls explain greedy algorithm

[@nuel99fc11]

I have a lot of questions. Is this a language? What is this? What does it mean?
Also, I am looking for content to understand core programming better. Not necessarily involving a language

[@insidecode]

Are you talking about the code? If yes it's in Python language

[@insidecode]

For core programming you can start by learning about programming basics like what is programming, variables, conditions, loops... Then you can learn about algorithms and data structures in my channel, I try to explain things in a general way

[@nuel99fc11]

@@insidecode alright . Algorithms and data structures it is then.
I know about variables and loops, etc. It’s a bit stale hearing all those basics. It feels like I’m not progressing

[@insidecode]

To progress you need to practice, try creating some small programs with what you learnt

[@nuel99fc11]

@@insidecode I’m doing that currently. I’m trying to push as fast as I can

[@AmNotLegend]

don't need read out all numbers

[@ikram5011]

Thank u

[@insidecode]

You're welcome iko

[@greob]

Great video, nice presentation.

[@insidecode]

Thank you!