What is Balancing a binary tree and why do we need balancing

Опубликовано: 01 Октябрь 2024
на канале: Simple Snippets

35,773

773

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 - https://simplesnippets.tech/what-is-b...
Full DSA playlist -    • Introduction to Data Structures & Alg...
Full C++ Programming for Beginners Course -    • Introduction to Computer Programming ...
---------------------------------------------------------------------------------------------
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 -
http://simplesnippets.tech/
Simple Snippets on Facebook -
  / simplesnippets
Simple Snippets on Instagram -
  / simplesnippets
Simple Snippets on Twitter -
  / simplesnippet
Simple Snippets Google Plus Page -
https://plus.google.com/+SimpleSnippets
Simple Snippets email ID -
[email protected]

For More Technology News, Latest Updates and Blog articles visit our Official Website - http://simplesnippets.tech/
#datastructures #binarytree #binarysearchtree