Размер видео: 1280 X 720853 X 480640 X 360
Показать панель управления
Автовоспроизведение
Автоповтор
today is my exam and after searching all the contents in youtube , i saw your lecture . you taught the best way . hats of sir
Your this appreciation means a lot I am really happy to know that this lecture helped you 😊Kindly share the channel with your friends and juniors in college
Thanks a lot sir. Respect and Gratitude
Most Welcome😊
Fabulous sir. Thank you very much for your effort to teach in best possible way.
Thanks A Lot for taking out some time to appreciate my efforts☺️Please share the channel if it helped you🖤
This lecture was a life saver. It was impossible for me to understand this concept without your help sir. Thanks a lot
I am glad that the video was of some help to you..Keep Learning and Growing😊
Thanks so much for these videos on Fib heaps, saving me in my algorithms class
Most Welcome..😊😊😊And Keep watching and growing🖤
Thanks a lot 🙏
what an explanation....glad I found it
And I am equally glad that you chose to acknowledge the content😉🙂Keep growing🖤👍👍👍
thank you very much for making this video very helpful ❤❤❤❤❤❤❤❤❤❤❤❤❤❤💕💕💕💕💕💕💕💕💕💕😘😘😘😘
I am glad that you found my video so helpful☺️ Please share🖤🖤🖤
Boss if it's possible can you please upload video lectures on treaps ,skip list and trie.
Yeah sure, My upcoming videos are on all these data structures itself🙂Kindly share the channel as much as possible
@@uzairjavedakhtar3718 thank you Boss 👍🏻
Awesome explanation, bit slow , play at 2x
Great suggestion! 🙂Maybe it's your mind that runs at the speed of sound🤩😉
dsa playlist are many ...but you stand apart...advance dsa...
Thanks for your kind words 😊 please share this playlist with your friends
May I ask that the worst case of extract-min would be O(n) ,after I insert n node?
12:38 why 64 is left side of 14?
today is my exam and after searching all the contents in youtube , i saw your lecture . you taught the best way . hats of sir
Your this appreciation means a lot
I am really happy to know that this lecture helped you 😊
Kindly share the channel with your friends and juniors in college
Thanks a lot sir. Respect and Gratitude
Most Welcome😊
Fabulous sir. Thank you very much for your effort to teach in best possible way.
Thanks A Lot for taking out some time to appreciate my efforts☺️
Please share the channel if it helped you🖤
This lecture was a life saver. It was impossible for me to understand this concept without your help sir. Thanks a lot
I am glad that the video was of some help to you..Keep Learning and Growing😊
Thanks so much for these videos on Fib heaps, saving me in my algorithms class
Most Welcome..😊😊😊
And Keep watching and growing🖤
Thanks a lot 🙏
what an explanation....glad I found it
And I am equally glad that you chose to acknowledge the content😉🙂
Keep growing🖤👍👍👍
thank you very much for making this video very helpful ❤❤❤❤❤❤❤❤❤❤❤❤❤❤💕💕💕💕💕💕💕💕💕💕😘😘😘😘
I am glad that you found my video so helpful☺️ Please share🖤🖤🖤
Boss if it's possible can you please upload video lectures on treaps ,skip list and trie.
Yeah sure, My upcoming videos are on all these data structures itself🙂
Kindly share the channel as much as possible
@@uzairjavedakhtar3718 thank you Boss 👍🏻
Awesome explanation, bit slow , play at 2x
Great suggestion! 🙂
Maybe it's your mind that runs at the speed of sound🤩😉
dsa playlist are many ...but you stand apart...advance dsa...
Thanks for your kind words 😊 please share this playlist with your friends
May I ask that the worst case of extract-min would be O(n) ,after I insert n node?
12:38 why 64 is left side of 14?