Proof for fourth property comes from first 2^k = n so k = log(n) as we know k is order of tree which is also maximum degree possible at root. Good Explanation btw
This is the quality content we need, everyone skips the maths behind the algorithms and data structures which is the most crucial part. Thank You for making these detailed videos!!!
Very nice explanation! I'm unsure how to write it in the proper mathematical formalism, but the last property basically comes from the number of nodes in a binomial tree of degree k is 2^k. log(2^k) = k which is the degree of the tree. Combined with the fact that a tree of degree k is made up of two trees of degree k-1, we know the root node will have the most children (since the other tree is one of the root node's children, and that tree is only of degree k-1).
Could you make videos for Hash tables, an example of randomized analysis Greedy algorithms and matroids Dynamic programming and all-pairs shortest paths Linear Programming and Duality Primal-Dual schema as an algorithmic design tool NP-completeness Approximation algorithms
thank you for such awesome content sir
Happy to know that you found it helpful🙂 Please share it with others😉
@@uzairjavedakhtar3718 sure sir
Proof for fourth property comes from first 2^k = n so k = log(n) as we know k is order of tree which is also maximum degree possible at root. Good Explanation btw
Great answer thanks
This is the quality content we need, everyone skips the maths behind the algorithms and data structures which is the most crucial part. Thank You for making these detailed videos!!!
This means a lot.. Thanks for taking out time to write this. Also share these videos with your friends if you feel they helped you.😊
Very nice explanation! I'm unsure how to write it in the proper mathematical formalism, but the last property basically comes from the number of nodes in a binomial tree of degree k is 2^k. log(2^k) = k which is the degree of the tree. Combined with the fact that a tree of degree k is made up of two trees of degree k-1, we know the root node will have the most children (since the other tree is one of the root node's children, and that tree is only of degree k-1).
Nicely articulated😊 & thanks for the comment
Thank you! Please continue to upload.
wonderful video great explaniation sir💚
Thanks A Lot. Hope it helps you😊
my left ear has learnt everything
😁
Could you make videos for
Hash tables, an example of randomized analysis
Greedy algorithms and matroids
Dynamic programming and all-pairs shortest paths
Linear Programming and Duality
Primal-Dual schema as an algorithmic design tool
NP-completeness
Approximation algorithms
Thank you for the explanation!!
Thanks A Lot🖤
1:10 why I am not able to hear in my right earphone, Is there any problem with the youtube or in my earphone
?
Your earphone🙂
same here'
You are awesome!!!!
just switch on mono audio
both earphones will work