Комментарии:
Sir It is so helpful, the way you made the concept easy and making funny relations is great.
ОтветитьWhere are the notes
ОтветитьVery easy explanation
ОтветитьSimple and beautiful!
Ответитьvery goond vindeo !!
Ответить9years ago 💥💚
ОтветитьHe is no more .
thank you sir your explanation way is amazing.
Thank you for your guidance.
ОтветитьYou are really outstanding!!!
ОтветитьAmazing video thank you !
ОтветитьWow blessed to get this channel 🙏🙏
ОтветитьThank you this was very helpful! :D
ОтветитьRIP BROTHER LOVE U ALWAYS
ОтветитьThank you so much sir
Ответить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?
ОтветитьSo if it isnt binary, can I use like vector in storing the addresses of the childs?
ОтветитьSaviour of Programming seekers
ОтветитьI will be forever grateful to The Lord Harsha sir
ОтветитьOracle documentation be like 👀
Ответитьperfect video about tree..
* short and brief...
* easily understanding...
* point to point...
* teaching style is good
* after 8 years still in top
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
THANK YOU SO MUCH!
ОтветитьMan why do they have so many relatives,they are just numbers 😭
Ответитьamazing video
ОтветитьWow
Ответитьthank you!
Ответить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!
ОтветитьThese videos of data structure is reliable during my C-DAC examination.
ОтветитьThis is so useful, thank you so much for uploading.
ОтветитьI'm understanding human relations after learning tree lol
Ответитьyour explanation very good
ОтветитьWOW Amazing.
Ответитьshoutout da sa mga classmates ko kung ga tuon mn gd kmo
Ответить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.
ОтветитьFantastic sir 😊
ОтветитьThank you.
Ответить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
ОтветитьHindi language
ОтветитьCan't believe this video was uploaded in 2014
ОтветитьBest video on Trees even after 7 years...❤
ОтветитьExcelente!!
ОтветитьIt's very gud way to understanding and tqq to lecturer for this video ...
ОтветитьThis video is from 2014, and it's understandable in 2021, so imagine how good he is at explaining these things. This channel is gold.
ОтветитьThank you very much.
ОтветитьWe love you Animesh
ОтветитьPerfect lecture
ОтветитьThis is the most interesting content about ds & al at the entire internet sir!!!!
ОтветитьIn 15 mins he taught more than my professor could teach in an hour. Hats off!
ОтветитьGod bless you and your family abundantly!
Ответитьnice explanation
Ответить