Hi bro plz teach web development after dsa then system design and next cn dbms and os so that it will help for placement after that teach other courses bro it Wil helpful for placement
//MIN HEAP class MinHeap{ int *arr; int size; //number of elements in arr int total_size; //total capacity of arr public: MinHeap(int n){ arr = new int[n]; size = 0; total_size = n; } //insert function void insert(int x){ if(size == total_size){ cout
dono if condition h to phli if codition se agar left bda hoga to vo largest me chala jayega and dusri condition se agar right largest se bda hoga(jo ki left ke equal h kyuki left largest se bda mana tha) to largest = right ho jayega and ese largest me vhi value aayegi jo sbse bdi h teeno me
Heap Chamak gaya fr?
Bilkul 🔥
Itna chamak Gaya ki samne wale ko chamka de
Brother ik TRIES topic in c pr bhi vdo needed h.
Chamak Gaya 🔥🔥
yes, aapne but OS and CN mein interest dila diya aaj to
Really When you have excellent amount of knowledge no one can replace you, so learn much as possible ❤❤❤🙏
Bhaiya aaj ka lecture 6 se pehle aa gya. Bhaiya aapki consistency next level hai. Thank You Bhaiya ❣️
One suggestion: Bhaiya app terminal main right click karke clear karne ke alawa aap cmd + K ka use karo auto clear ho jayega
bhai we need networking , information security course on youtube as soon as possible please
This is one of the best resources I’ve found for learning DSA. The explanations are clear and simple.
trust me...this series is best all over the u tube
Thanks you for explaining in depth
DSA is getting fun now
G.O.A.T of all series ❤❤❤
Hi bro plz teach web development after dsa then system design and next cn dbms and os so that it will help for placement after that teach other courses bro it Wil helpful for placement
Jai shree Ram ❤️
Ek dum ache se chamk gaya Dil se shukriya
bhaiya heap pahli baar itna depth mai samajh aaya
Maja aa gaya bhaiya ji thanks for this masterpiece series of DSA ❤️
maja aa gya bhaiya kya concept diya hai bhaiya aapne dil garden garden sa ho gya ☺☺☺
Bhaiya terminal main right click karke clear karne ke jagah …aap cmd+k ka use karo auto clear ho jayega
Day 183 ✅🔥
Hn bhaiya heap acche se chamak gya ✨
Good Morning bhaiya feels good to be back at it
Today's lecture was fun
amazing reply aise hi thodi na IIT se 2cr ka package mila hai
Dada lots of love from Uttarakhand ( Bageshwar uk 02)
bhiaya chamak gaya bahut ache se
And yeah excited for Computer networks & OS course
Chamak Gaya bhaiya 🤩✨
Awesome bhaiya ❤
thanks you brother
Sir Greater e kya hai min heap mai
Chamak gaya bhai you Are great you are genius
samajh aa gya bhaiya sab 😼
Bhaiya ek video gate da pe banaiye
How to prepare gate da 2025..🙏🙏
it was a really great lecture thanks bhaiya!
Nice lecture and explanation bhaiya
dsa me ummed kho di thi appki wajah se acche se karne laga hu
u should never lose hope
What a content bhaiya ☺️☺️.
Sir to find the number of nodes in every level is n+1/2 from the last level for top level n+1/2*h
crystal clear
Good morning bhaiya ji.
nice explanation
Brilliant video ❤❤
mzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaa gyaaaaaaaa BHAIYA JI
Chamak gaya ❤
🌿🌿iitG ka sherr
Best video ever
Bhaiya Radhe Radhe 🙏
Great bhayiya aap kaise timing se video upload karate hai ❤
thank u bhaiya jii
Thanks bhaiya 🙏🏻
wow, amazing lec
Understood heap😎
Good morning bhaiya ji 😊
good morning bhaiya🥳🥳
Chamak gya bhaiya ❤
Bhaiya IIT jee nhi nikla lekin fir bhi aati h maths to👍
good yrr heavy video
Good morning bhaiya ji😍
what is base case for heapify function
Awesome!
33:28 left
chamak gaya bhaiya
mashallah
//MIN HEAP
class MinHeap{
int *arr;
int size; //number of elements in arr
int total_size; //total capacity of arr
public:
MinHeap(int n){
arr = new int[n];
size = 0;
total_size = n;
}
//insert function
void insert(int x){
if(size == total_size){
cout
Good morning bhaiya❤
thankuuuuuu so much
Nice video
Nice ❤❤
33:30 , agar dono right aur left largest se bade he to , we need to take the max of right and left and then store it into largest ??
dono if condition h to phli if codition se agar left bda hoga to vo largest me chala jayega and dusri condition se agar right largest se bda hoga(jo ki left ke equal h kyuki left largest se bda mana tha) to largest = right ho jayega
and ese largest me vhi value aayegi jo sbse bdi h teeno me
baiya full dsa playlist karu or topic wise playlist sa karu?
Done bhaiya
28:56 Bhaiya flow flow me taylor swift algorithm keh gye 😅
1:05:31 bhaiya saying ham jaise garib log after recieving highest package in india 😆😆
Bhiaya ap heap ke questions bhi solve karayenge kya next lecture meand heap kitne din me complete hoga
🤩
❤
1:05:00 bhaiya after getting 2 cr. package hum garib log 🤣🤣🤣🤣
Bhaiya time jda nhi hmare pass 3rd year ke last sem chal rhe, Sare vdos apke dekhu ya topic wise,, dsa ke??
dada jab Heap Sort me Heapify call karenge tab kaya i ki jaga i-1 hoga..?
chamak gaya!!!
chamak gya
Bhaiya 😚
Day 183 #180DaysOfCode
❤❤👍👍
bhaiya yaha tk chamak gya h
Maja aa gaya
Bhai last wala code chahiye
#180daysofcode
Chamka
27:14 bhaiya became roaster 😂😂
Chamak chuka ha bhaiya
Chamak gya
opop
c++
// Thank me Later !
#include
using namespace std;
class minHeap
{
vector v;
int size;
int maxSize;
public:
minHeap(int x)
{
size = 0;
maxSize = x;
}
void insert(int value)
{
if (size == maxSize)
{
cout v[index])
{
swap(v[index], v[(index - 1) / 2]);
index = (index - 1) / 2;
}
return;
}
void print()
{
for (int i = 0; i < size; ++i)
{
cout
chamka bhaiya🙂
Chamak Gaya
Rohit Gareeb hm hai aap thodi...................
Bhaiya please apna Twitter account de do mujhe
❤❤