Sir I would like to give you a compliment on your consistency. Your's is the only UA-cam channel on Algorithms which covers every single topic no matter how small and explain it in the easiest way possible.
bro! i am in iit right now and i will be having placements this year in december . lectures are really helpful . upload as much as you can to help the community and also program it too on the white board.thanks for the effort
Wow, this video is very useful. Your explanations are clear and understandable. Can you please make a video on Graphs as well. Directed and Undirected?
Sir your class is good. Height of the tree is the number of edges from root to leaf in the longest path and not the number of nodes. You said the height is 4 for the first tree. Please reconcile.
one small correction dude! At 2:30 You said that the height of the binary tree as 4 but you are wrong .Height is the distance between node and longest path of leaf node which is 3.Height of root node =3.Here the comparing with root node is constant O(1+h)=O(h)
Pseudocodes for some Red black tree procedures are in CLRS introduction to algorithms but some procedures are left as homework I watched video where they compare Red black trees and AVL trees and they claim that red black trees are not as balanced as AVL trees
Thank you very much man ! you have great explanations ! Do you have - Given a BST, check if it's balanced? (it's fine if not, you have so many valuable videos I think I will be able to learn and do it myself) Thanks again
Hi Sir..All I can say is your teaching is Awesome...It is helping all of us A lot....Few Suggestions if Possible if you can execute these programs than it will help us A lot...Thank you so much. do u have any fb page or can you give yours mail id
Sir I would like to give you a compliment on your consistency. Your's is the only UA-cam channel on Algorithms which covers every single topic no matter how small and explain it in the easiest way possible.
you are the best! No one can explain like you!
You're an absolute best teacher at teaching AVL! You earned my subscription! :)))
Indian Teachers are dammn good And so you are .
شكرا لك من اعماق قلبي أخوكم من اليمن
Thank you brother for your valuable lectures
bro! i am in iit right now and i will be having placements this year in december . lectures are really helpful . upload as much as you can to help the community and also program it too on the white board.thanks for the effort
Pleas make videos about black and red trees ! your explanations are awesome
Wow, this video is very useful. Your explanations are clear and understandable. Can you please make a video on Graphs as well. Directed and Undirected?
Sir your class is good. Height of the tree is the number of edges from root to leaf in the longest path and not the number of nodes. You said the height is 4 for the first tree. Please reconcile.
Your videos are awesome! 🙂Thank you sir#All the way from Zambia🙂
your class is good, please exlain topics: btree, hash table,b+tree
NIce explanation... helps a lot
At 6:35 height(no. of edges from root to deepest node) of left subtree is 2 not 3.
Hi Vivekanand, would be of great help if you post videos on red black trees.
ua-cam.com/video/6mkgIwoGWhE/v-deo.html check here for red black tree if you like please subscribe to this channel
Please give idea about how to calculate output of a complex circuit in logic gate
sir i m learning a lot from you i am so thankful & if u can , then please post video on - distribution counting sort algorithm .
Hi sir very thanks for your great lecture I want lecture fordistance level of binary nodes
good one..
please post video on topological sort also...
Good video
Suggesion : whtch at 1:25 speed ( :
Please make a video about Red-Black tree
Sir explain about trees and graphs in data structures and send me the videos about that topics
Wonderful explanation thank u sir
Superb Explanation
Your explanations are really very osam😘
Yes
one small correction dude! At 2:30 You said that the height of the binary tree as 4 but you are wrong .Height is the distance between node and longest path of leaf node which is 3.Height of root node =3.Here the comparing with root node is constant O(1+h)=O(h)
good explain......Thanku
Just play it on 1.25x (for all videos).
Hello Vivek, Could you please make video on Red-Black tree? Thank You!
great , why don't we get Red black tree?
same was asking
Pseudocodes for some Red black tree procedures are in CLRS introduction to algorithms
but some procedures are left as homework
I watched video where they compare Red black trees and AVL trees and they claim that red black trees are not as balanced as AVL trees
Thanks,great video
perfect
You have my subscription brother! Love from Pakistan.
sir please solve the example H I J B A E C F D
Sir... Advantage of height balance tree..
super
i need a explanation for b-tree and splay tree
pls make video on backtracking
can anyone give me code of avl tree pls
To Visualize
www.cs.usfca.edu/~galles/visualization/AVLtree.html
Thank you so mutch♥️♥️😭
Thank you very much man ! you have great explanations !
Do you have - Given a BST, check if it's balanced? (it's fine if not, you have so many valuable videos I think I will be able to learn and do it myself)
Thanks again
good teacher. thanks from ISRAEL!
Am i the only one who thinks
Balance factor = height of right subtree - height of left subtree
And not the other way round
Yes
I agree - he has a lot misunderstanding in his lectures.
Height of first bst is 3 not 4 ?
No, height is 4
Your vedio so moccha
Hi Sir..All I can say is your teaching is Awesome...It is helping all of us A lot....Few Suggestions if Possible if you can execute these programs than it will help us A lot...Thank you so much. do u have any fb page or can you give yours mail id
make video on heap memory
Yes
10:15 , 0.25x, He came back from thanos's snap!
Height of that tree is 3 ... not 4...
Agree with you
Wonderful explanation
Sliit eke un like ekak dapan
Second last is balance due to balancing factor 1
Play video in 2x
please make video on red black tree
sir please solve the example H I J B A E C F D