Тёмный

DAA48:Binomial Heap Operations|Inserting a node|Extracting minimum key|Decreasing Key |delete a Node 

University Academy
Подписаться 133 тыс.
Просмотров 63 тыс.
50% 1

Download Notes from the Website:
www.universityacademy.in/prod...
Or universityacademy.myinstamojo...
Download DAA Hand Written Notes: imojo.in/335py6y
Join our official Telegram Channel by the Following Link:
t.me/universityacademy
Join WhatsApp Group by Link: chat.whatsapp.com/FjPSEITZFbY...
Topics: Design and Analysis of Algorithm, Advanced Data Structures, Divide and Conquer, Greedy Methods, Dynamic Programming, Backtracking, Branch and Bound, Selected Topics.
Faculty: Sandeep Vishwakarma
University Academy is India’s first and largest platform for professional students of various streams that were started in 2017. University Academy comprises of a committed band of highly experienced faculties from various top universities or colleges of India.
……………………………………………………………………………………………………………………………………………………………
#DAA #SandeepSir #OnlineCourses #AcademicSubject
……………………………………………………………………………………………………………………………………………………………
Complete Playlist :
1. • Programming For Proble...
2. • C Programming For Begi...
3. • Basic Electrical Engin...
4. • Fundamentals of Electr...
5. • PPS Lab(KCS151P / KCS2...
6. • Engineering Physics
7. • Fundamentals of Mechan...
8. • Artificial Intelligenc...
9. • Emerging Domain in Ele...
10. • Data Structure Lecture...
11. • Theory of Automata and...
12. • Operating System Tutor...
12. • Python Programming A P...
14. • Software Engineering
15. • Computer Organization ...
16. • Discrete Structures an...
17. • Design and Analysis of...
18 • Compiler Design Tutori...
19. • Principle of Programmi...
20. • Web Technology In Hindi
21. • Data Warehousing and D...
22. • Database Management Sy...
23. • Cyber Security Tutoria...
24. • Computer Network Tutor...
25. • Distributed System Tut...
26. • Cloud Computing Tutorial
27. • Manufacturing Processes
28. • Network Analysis & Syn...
29. • Class 10 Maths(NCERT |...
30. • Control System Lectures
31. • Microprocessor Lecture...
32. • Digital System Design ...
33. • Signals & Systems Lect...
34. • Transportation Enginee...
36. • Android Studio 3.0 (Mo...
36. • C Programming : Practi...
37. • JavaScript in Hindi
38. • Java Programming in Hindi
39. • JFLAP/TAFL Lab(Theory ...
40. • Tech News
41. Other: • Other
-------------------------------------------------------------------------------------------------------------
Regards
University Academy
WhatsApp: +91-9311825328
Email: info@universityacademy.in
Website:
www.universityacademy.in
www.universityacademy.co.in

Опубликовано:

 

15 окт 2019

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 23   
@ujjvalcodes3629
@ujjvalcodes3629 2 года назад
One of best videos on Binomial Heap lectures. You did an excellent job. Keep up the good work 😃.
@shrutijais3217
@shrutijais3217 2 года назад
One of the best videos on binomial heap Thank you sir
@akhilnamburi7083
@akhilnamburi7083 3 года назад
Tq u sir u the only one who did videos on heaps
@caru_candra_krsna_das
@caru_candra_krsna_das 3 года назад
great job explaining this concept. The professors at the big universities couldn't do what you did. Thanks :)
@toshityagi2018
@toshityagi2018 3 года назад
Thanks sir.....very nice explanation
@champgirl4338
@champgirl4338 2 года назад
In Deleting operation u have a mistake in last when we check b1 and b1 for 12 and 7 root we can't pointer ahead we remove x and attached to next [x].apart from this very helpful lecture it is.
@manvijain4343
@manvijain4343 3 года назад
when all are equal( B1) in deleting node property then we should move pointer ahead according to your last union property video then why u merged them?
@bing9371
@bing9371 3 года назад
minimum extraction ke time agar minimum root node ke ek se zaada child hue to konse vaale se replace krenge?
@raginirajpoot2711
@raginirajpoot2711 2 года назад
Minimum child se
@vishalkanojia5271
@vishalkanojia5271 4 года назад
19 ko sesnal hai-:)
@tanishqtripathi5228
@tanishqtripathi5228 3 года назад
- infinite se decrease krenge ki replace krenge
@BarkaDog
@BarkaDog 3 года назад
Both will give same result
@vishalkanojia5271
@vishalkanojia5271 4 года назад
sir next videos kab tak ayenge????
@eneshkaneshk380
@eneshkaneshk380 Год назад
Sir aap frst node k samne.,. Head(1) likhte ho ja Heap(1) .?
@harshvardhan_singh1130
@harshvardhan_singh1130 6 месяцев назад
Head[H1]
@eneshkaneshk380
@eneshkaneshk380 6 месяцев назад
@@harshvardhan_singh1130 sir ab to ma paas b ho gyaa 😃.., (too late rply)
@harshvardhan_singh1130
@harshvardhan_singh1130 6 месяцев назад
@@eneshkaneshk380 arey yrr I'm not sir 😂 I'm in 3rd year .... Ure my senior 🥰
@harshvardhan_singh1130
@harshvardhan_singh1130 6 месяцев назад
@@eneshkaneshk380 from which college?nd course
@eneshkaneshk380
@eneshkaneshk380 6 месяцев назад
@@harshvardhan_singh1130 KUK University., CSE
@Animeter22
@Animeter22 3 года назад
How to download notes?
@ashutoshdixit2985
@ashutoshdixit2985 3 года назад
pta nhi
@dheerajsahu4163
@dheerajsahu4163 6 месяцев назад
Ok​@@ashutoshdixit2985