What is Balancing a binary tree and why do we need balancing
HTML-код
- Опубликовано: 30 июл 2024
- A Binary Tree is called BALANCED binary tree (or binary search tree) IF the difference between the HEIGHT of the Left Sub Tree & Right Sub Tree for every node is not more than k (usually k = 1)
Height of a binary tree is the number of edges/links on the longest path between the root node & leaf node.
In this tutorial we will answer 2 main questions -
1) What does Balancing a Binary Tree mean ?
2) Why is Balancing a binary Tree Important ?
---------------------------------------------------------------------------------------------
Full Code & Other resources - simplesnippets.tech/what-is-b...
Full DSA playlist - • Introduction to Data S...
Full C++ Programming for Beginners Course - • Introduction to Comput...
---------------------------------------------------------------------------------------------
Support Simple Snippets by Donations -
Google Pay UPI ID - tanmaysakpal11@okicici
PayPal - paypal.me/tanmaysakpal11
---------------------------------------------------------------------------------------------
Timecodes -
00:00 Introduction
01:11 What is Tree Balancing ?
12:58 Why Balancing Tree is needed ?
---------------------------------------------------------------------------------------------
Simple Snippets Official Website -
simplesnippets.tech/
Simple Snippets on Facebook -
/ simplesnippets
Simple Snippets on Instagram -
/ simplesnippets
Simple Snippets on Twitter -
/ simplesnippet
Simple Snippets Google Plus Page -
plus.google.com/+SimpleSnippets
Simple Snippets email ID -
simplesnippetsinfo@gmail.com
For More Technology News, Latest Updates and Blog articles visit our Official Website - simplesnippets.tech/
#datastructures #binarytree #binarysearchtree
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!
I have finished the full playlist please upload fast
Good to see another video added to the playlist. 🙌
More to come!
You teach very well! Thank you! You taught me what I needed
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.
This guy is a saviour
thank you,really helpful.
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
in it both cases have same lower bound?? correct me if I am wrong?? thanks
Great explanation. What is the tool or device used to demo. The mouse pointer was pretty precise and steady.
What software do u use to write on the screen ?
Nice explanation
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 😊
that was very helpful
tnx boroo helped
Nice explanation ❤
thank u for good content
My pleasure
Please make a video on index sequential search .
What's the name of application you use for the digital blackboard
SmoothDraw4
please make a video on index sequential search
Awesome!
Thank you! Cheers!
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
hello sir, when you add graph data structure tutorial in your playlist... ???
Will upload soon
I also sometimes get confused with 'un' and 'im' haha. I can feel you
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
Next avl trees pls
Yup
Can you tell me about scapegoat??
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
💥
Can you cover B-Trees? Its a topic I’ve struggled with understanding and implementing. Thank you for the quality content
Will try
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 ! ❤️❤️
❤
i waste my 25:38 mins in this video
Awful presentation.