Комментарии:
Excelente!!
ОтветитьBest video on Trees even after 7 years...❤
ОтветитьCan't believe this video was uploaded in 2014
ОтветитьHindi language
Ответитьlove your content and the way you explained the concepts is like no one can teach us ,I repeat no one in this world.......you are the bestest.....thank you harsha and animesh sir ,you both are legends .............also very sad to know about harsha sir....RIP
ОтветитьThank you.
ОтветитьFantastic sir 😊
ОтветитьHi. I am one of your subscriber, been following you for a couple of months. Can i possibly use this as a reference in our class, seems like you do have a very clear way of explaining. Thankyouuu.
Ответитьshoutout da sa mga classmates ko kung ga tuon mn gd kmo
ОтветитьWOW Amazing.
Ответитьyour explanation very good
ОтветитьI'm understanding human relations after learning tree lol
ОтветитьThis is so useful, thank you so much for uploading.
ОтветитьThese videos of data structure is reliable during my C-DAC examination.
ОтветитьI read maybe 3 or 4 times the Wikipedia page and didn't get it, but with this video I could understand perfectly. Thank you!
Ответитьthank you!
ОтветитьWow
ОтветитьMan why do they have so many relatives,they are just numbers 😭
ОтветитьTHANK YOU SO MUCH!
ОтветитьFor data that is naturally hierarchical
A collection of entities, nodes, linked together to simulate a hierarchical. Non linear data structure.
Height and depth
Types of trees:
At most two children - binary trees
perfect video about tree..
* short and brief...
* easily understanding...
* point to point...
* teaching style is good
* after 8 years still in top
Oracle documentation be like 👀
ОтветитьI will be forever grateful to The Lord Harsha sir
ОтветитьSaviour of Programming seekers
ОтветитьSo if it isnt binary, can I use like vector in storing the addresses of the childs?
ОтветитьHi, I am confused about the depth of a node. As a directed tree can have multiple parents (references pointing at it), the case where a node will only have one parent pointing is in the case of the tree is an arborescence tree. So, if it is a normal directed tree, how do you find the depth of that node, as it has more than one reference?
ОтветитьThank you so much sir
ОтветитьRIP BROTHER LOVE U ALWAYS
ОтветитьThank you this was very helpful! :D
ОтветитьWow blessed to get this channel 🙏🙏
ОтветитьAmazing video thank you !
ОтветитьYou are really outstanding!!!
ОтветитьThank you for your guidance.
ОтветитьHe is no more .
thank you sir your explanation way is amazing.
9years ago 💥💚
Ответитьvery goond vindeo !!
ОтветитьSimple and beautiful!
ОтветитьVery easy explanation
ОтветитьWhere are the notes
ОтветитьSir It is so helpful, the way you made the concept easy and making funny relations is great.
ОтветитьThanks
ОтветитьI wish I knew this channel earlier
Ответитьwell made video
ОтветитьThe best educational channel.
Ответитьthank you
ОтветитьThis is it for this lesson .Thanks for watching❤❤❤❤.love you❤❤
ОтветитьA standing ovation sir 💪
This channel is the Khan Academy India of Computer Science 🤎
Your courses are simply excellent!
ОтветитьI cannot imagine my life without this playlist, from my heart thanks
ОтветитьKind of bizarre that even though this is the exact structure of a family tree, it doesn't look like it would be the proper data structure to store a family tree. There doesn't seem to be a good way to quickly search for cousins or more distant relatives. Guess that would have to be a graph with an algorithm that could add new edges as "shortcuts" between nodes that are connected via multiple edges.
Ответить