Height Balanced Binary Tree | C++ Placement Course | Lecture 27.9
HTML-код
- Опубликовано: 2 окт 2024
- Complete C++ Placement Course (Data Structures+Algorithm) : • C++ Full Course | C++...
Telegram: t.me/apnikaksh...
Instagram: / dhattarwalaman
Notes of this Lecture:
Done with the 100th video. Started this playlist once before but gave up at arrays due to not being confident enough if i had a proper grasp on the topics or not. Things were different this time around. Before moving forward, I would like to thank every single member of Apna College team. Thank you for the amazing animation, brilliant teaching and enjoyable questions. Sad that only a few people have reached this far till now.
One of the best explanations in whole series is done by this teacher!! She explains very well!! Aisa lagra hai jaisa binary tree hi sabse best samajh mein aaya hai!!
Same brother
Done with the 100th lecture ,a major thanks to all the educators for this legit course.
completed century..... Big thanx to Apna college, Animator, and Aman bhaiya. May God bless u all.
As you can see only 64 people have reached here till now including me. So congratulations to you for being one of the best of the best 😍🥳
temp notes:
// #include
// using namespace std;
// class Node
// {
// public:
// int data;
// Node *left;
// Node *right;
// Node(int value)
// {
// left = NULL;
// right = NULL;
// data = value;
// }
// };
// int height(Node *root)
// {
// if (root == NULL)
// {
// return 0;
// }
// int k = height(root->left);
// int f = height(root->right);
// int check = max(k, f) + 1;
// return check;
// }
// bool balancedtree(Node *root)
// {
// if (root == NULL)
// {
// return true;
// }
// if (balancedtree(root->left) == false)
// {
// return false;
// }
// if (balancedtree(root->right) == false)
// {
// return false;
// }
// int a = height(root->left);
// int b = height(root->right);
// if (abs(a - b) left = new Node(2);
// root->left->left = new Node(3);
// // root->left->left->left = new Node(4);
// // root->left->left->left = new Node(5);
// root->right = new Node(4);
// cout right,&rh) == false)
{
return false;
}
*height=max(lh,rh)+1;
if (abs(lh-rh) left = new Node(2);
root->left->left = new Node(3);
root->left->left->left = new Node(4);
root->left->left->left = new Node(5);
root->right = new Node(4);
int height=0;
cout
thank you so much for providing notes under most of the videos
You are calculating height of each node repeatedly for each node which makes its times complexity to above O(n)
Completed 100th video.........!! for c++ DSA series, being a mechanical engineer I wanted to go in IT industries and this series is really helping me out in my journey. Initially I was not enough confident but now with the time I am growing day by day, hope so I shall be able to complete all the playlist. A big big THANKS to Apna collage team.
konsa clg h???
@@abhinavshukla6418 RSCOE Pune
bool isBalanced(Node* root){
if(root == NULL){
return true;
}
int LH = Height(root->left);
int RH = Height(root->right);
if(abs(LH-RH) left);
isBalanced(root->right);
return true;
}
return false;
}
I think this one is easier to understand.......
She Explains every point very well :) Didi Rocks ❤
Aman bhaiya can you make a podcast with sagar dodeja (IES officer ,Gate topper).Because you both are my inspiration 🙏🏼😘😍
Great work. Century completed🤩🤩
simple code:
int balanced_height_tree(Tree* node, int &bal)
{
if(node==NULL)
return 0;
int l=balanced_height_tree(node->left,bal);
int r=balanced_height_tree(node->right,bal);
if(abs(l-r)>1)
bal=0;
return max(l,r)+1;
}
bool bal_tree(root)
{
int bal=1;
balanced_height_tree(root,bal);
return bal;
}
thanks bhai
lh - rh right);
return max(lHeight, rHeight) + 1;
}
bool isBal(Node* root)
{
int lh = CalcHeight(root->left);
int rh = CalcHeight(root->right);
if ( lh - rh right = new Node(3);
root->left->left = new Node(4);
root->left->right = new Node(5);
root->right->left = new Node(6);
root->right->right = new Node(7);
root->right->right->right = new Node(7);
root->right->right->right->right = new Node(7);
cout
Because we are visiting a node only once and we are doing single operation
Please can some one tell me how that height pointer calculated the height of the node simultaneously with checking the node.
Basically she keeps making integers LH and RH for each node and sends their pointer to the left and right children so that it may get updated with the height of their children and so on.
@@shaheenrafiq5974 everytime it will be 0 then? how can we calculate max(lh,rh)
@@rajmhatre20 In leaf node lh and rh are 0, thus *height becomes 1, thus either lh/rh of calling function becomes 1 as we are calling by address and not by value, then this cycle continues.
100 Videos Completed!!
Thanks Apna College!
#include
using namespace std;
struct Node {
int data;
struct Node*left;
struct Node*right;
Node(int val){
data=val;
left =NULL;
right=NULL;
}
};
int height(Node* root)
{
if(root==NULL) return 0;
return max (height(root->left),height(root->right))+1;
}
bool isbalanced(Node* root)
{
if(root==NULL)
return true;
if(isbalanced(root->right)==false)
return false;
if(isbalanced(root->right)==false)
return false;
int lheight=height(root->left);
int rheight=height(root->right);
if(abs(lheight-rheight)left = new Node(2);
root->right = new Node(3);
root->left->left = new Node(4);
root->left->right = new Node(5);
root->right->left = new Node(6);
root->right->right= new Node(7);
if(isbalanced(root))
cout
Congratulations to me for completing 100 videos today 🙋 a more 116 to go 😘😍❤️
Amazing explainations didi .You are the best.
Ty AC team
done with hundred lectures .
Sukriya baba for such a great course
Chaloo 100th lecture accomplished
your videos are amazing bhaiya
bhai pdh bhi rahe ho sath me ki ni
@@yashasvi9301 padh raha hu bhai
Abhi to behna samaja rahi hai😁
she is amazing in clearing each concept!!
Here TC I guess O(n)
Pointer vaali technique theek se samajh nhi aayi 🥺
same yr
Data Structure Lab 10: AVL Tree Implementation in C++| AVL Insertion | AVL Rotations | AVL vs BST
ruclips.net/video/VojjAbExgfg/видео.html
Shradha didi op tutor
Century ho gayi Bhaisahab, ab apun chand pe jayega!
can someone plz explain how height variable counted without incrementing lh and rh variable.
we passed address of lh & rh not values. so when we will reach to leaf of left sub tree , there the lh becomes 1 then the height will increment by one. then we back to leaf-1 node of left subtree where *height=max(lh, rh)+1& lh ==1 so height=1+1;
and so on.......
because of recurtion
100 done!! :)
bhaiya ek suggestion h ki aap last ki videos jinme bacho ko zada doubts h un videos k liye live class rakhlo
aur ya fir comments section m jo doubts h unhe lekar video record krdo taki apko video dubara bhi na banana pde aur content aur zada better hojaye
Thanku soo much Sirji and Didi 🌺 ji
very good and crystal clear explaination
we should also do *height=0 if(root==NULL)
right? because we did the same in the previous video(video no 98) while calculating diameter in O(n) .
Yeah I guess
yes, in last video we did it and I don't know why we did it. Can someone please explain
@@adityabhandari6688 actually we don't to do it at all, when recursion reaches the final stack it automatically takes height as 0
@@rahul_ji21 ok, thanks
int height(Node *root)
{
if (root == NULL)
{
return -1;
}
return max(height(root->left), height(root->right)) + 1;
}
bool isBalanced(Node* root)
{
if (root == NULL)
return true;
int lh = height(root->left);
int rh = height(root->right);
if (abs(lh - rh) left) && isBalanced(root->right))
return true;
return false;
}
Microsoft didi op 🔥💥
class Node:
def __init__(self,val=0,left=None,right=None):
self.val = val
self.left = left
self.right = right
root = Node(1)
root.left = Node(2)
root.right = Node(3)
root.left.left = Node(4)
root.left.left.left = Node(5)
def check_balanced(root):
if not root:
return (0,0)
lh,lf = check_balanced(root.left)
rh,rf = check_balanced(root.right)
ch = max(lh,rh)+1
cf = max(abs(lh-rh),lf,rf)
return (ch,cf)
if __name__=="__main__":
height,balanced_factor = check_balanced(root)
print("balanced") if balanced_factor
How many days remaining for completion of this course
Bhaiya discord link not working on apni kaksha channel please update it 😬
Where is the function abs???
I think you should show full code at a glance..can't make out
2 minute silence for those who were thinking that she is teaching AVL Tree😂
The Numbers of views on this shows how many people leave what they started pretty soon.
Nonetheless *First Milestone Completed*
Are notes to do bhai video age peeche karke kab tak banaye
Sometimes plz do explain by tracing also
2:21 Use zee roh kehte hai!!
Data Structure Lab 10: AVL Tree Implementation in C++| AVL Insertion | AVL Rotations | AVL vs BST
ruclips.net/video/VojjAbExgfg/видео.html
Century Completed... ❤❤❤
if root == NULL
return -1;
ye LH & RH kaise count ho rhe h ?
rh aur lh ki value to update kaise ho rhi h?
100 videos done
Notes please
Kbhi dry run bhi krdiya kro didi😔🥲
very clean , clear and concise explanation ❤.
100 complete💕
I haven't find best explanation for this topic and this video lecture is unfortunetly no exception
🙂😶😶
While understanding recursion i just realized TENET is based on recursion only😂😂😂
Notes
Very informative thanks.
Maje aagai 💯 percent high with josh
Dhanyawaad
shouldnt that be static int?
no
@@shivanshshukla8911 why not?
@@ashwinvarma9349 If u take it as static, then u are storing left height of all nodes in same variable[ as static variable lives in memory throughout all recursion chains], so it is better to store left height of diff nodes in diff variables[ as there might be chance of overlap].
Then, lh and rh will always be equal.
God bless you all team
❤❤
Century. The pitch wasn't easy to play as the ball was spinning a lot (i.e. questions). But I kept my calm and composure. I didn't let the questions dominate me for long. I will try to convert this hundred into a double hundred. I won't let that momentum slip away.
Thanks to my coaches aman bhaiya and this di and the rest of the team.