Hi tanmay Bhaiya i just can't thank you enough for your efforts for this most efficient DSA playlist course.No one and i mean it even paid courses don't have as much detailing as your videos please keep up with the good work and thanks a lot
Thanks buddy! Please do share the videos and our channel with your friends if you want to genuinely support me & our channel!✌😇 With your support I can keep making many more such educational videos FREE for everyone!
Height of a tree is not the number of edges, but the maximum depth of the elements. If tree has only a root then the height is not 0, it is 1. Similarly on your diagram the N7(32) height is 4, but not 3
A balanced binary tree, also referred to as a height-balanced binary tree, is defined as a binary tree in which the height of the left and right subtree of any node differ by not more than 1.
Any would work, no? Unless you mean which one to use to check if a binary tree is balanced or not, and then I don't think you'd use a search algorithm for that. Maybe a recursive function to check the difference height of every subtree of every node would do the trick
Hi tanmay Bhaiya i just can't thank you enough for your efforts for this most efficient DSA playlist course.No one and i mean it even paid courses don't have as much detailing as your videos please keep up with the good work and thanks a lot
Thanks buddy! Please do share the videos and our channel with your friends if you want to genuinely support me & our channel!✌😇 With your support I can keep making many more such educational videos FREE for everyone!
This guy is a saviour
Good to see another video added to the playlist. 🙌
More to come!
I have finished the full playlist please upload fast
Mr. You are such a BRILLIANT TEACHER. Just great prepared video and systematic explanation. Thank you for noble work.
Thank you for the kind words 😊
Height of a tree is not the number of edges, but the maximum depth of the elements. If tree has only a root then the height is not 0, it is 1. Similarly on your diagram the N7(32) height is 4, but not 3
A balanced binary tree, also referred to as a height-balanced binary tree, is defined as a binary tree in which the height of the left and right subtree of any node differ by not more than 1.
Nice explanation
You teach very well! Thank you! You taught me what I needed
Nice explanation ❤
I also sometimes get confused with 'un' and 'im' haha. I can feel you
tnx boroo helped
Great explanation. What is the tool or device used to demo. The mouse pointer was pretty precise and steady.
thank u for good content
My pleasure
hello sir, when you add graph data structure tutorial in your playlist... ???
Will upload soon
Awesome!
Thank you! Cheers!
Next avl trees pls
Yup
bhaiya threaded binary tree pe video banao please please please........... very less content is available on this topic on youtube
Will check up on this
thank you,really helpful.
that was very helpful
Hello sir also make vids on hashing table,collision ,and the graph theory ,greedy , Dijkstra .
After it will be a complete playlist ❤️
As soon as possible
@@SimpleSnippets Thank you sir ! ❤️❤️
Please make a video on index sequential search .
please make a video on index sequential search
What's the name of application you use for the digital blackboard
SmoothDraw4
in it both cases have same lower bound?? correct me if I am wrong?? thanks
What software do u use to write on the screen ?
What if we get 1 - 1 =0 from both subtrees is it balanced or unbalanced..
As long it less than k it balance
Assuem k=1 so yes
Can you cover B-Trees? Its a topic I’ve struggled with understanding and implementing. Thank you for the quality content
Will try
Can you tell me about scapegoat??
What type of search would you use to scan an unbalanced binary tree?
Any would work, no? Unless you mean which one to use to check if a binary tree is balanced or not, and then I don't think you'd use a search algorithm for that. Maybe a recursive function to check the difference height of every subtree of every node would do the trick
💥
❤
Awful presentation.
i waste my 25:38 mins in this video