Data Structures Tutorial

Data Structures Tutorial Asymptotic Notation Structure and Union Array Data Structure Linked list Data Structure Type of Linked list Advantages and Disadvantages of linked list Queue Data Structure Implementation of Queue Stack Data Structure Implementation of Stack Sorting Insertion sort Quick sort Selection sort Heap sort Merge sort Bucket sort Count sort Radix sort Shell sort Tree Traversal of the binary tree Binary search tree Graph Spanning tree Linear Search Binary Search Hashing Collision Resolution Techniques

Misc Topic:

Priority Queue in Data Structure Deque in Data Structure Difference Between Linear And Non Linear Data Structures Queue Operations In Data Structure About Data Structures Data Structures Algorithms Types of Data Structures Big O Notations Introduction to Arrays Introduction to 1D-Arrays Operations on 1D-Arrays Introduction to 2D-Arrays Operations on 2D-Arrays Strings in Data Structures String Operations Application of 2D array Bubble Sort Insertion Sort Sorting Algorithms What is DFS Algorithm What Is Graph Data Structure What is the difference between Tree and Graph What is the difference between DFS and BFS Bucket Sort Dijkstra’s vs Bellman-Ford Algorithm Linear Queue Data Structure in C Stack Using Array Stack Using Linked List Recursion in Fibonacci Stack vs Array What is Skewed Binary Tree Primitive Data Structure in C Dynamic memory allocation of structure in C Application of Stack in Data Structures Binary Tree in Data Structures Heap Data Structure Recursion - Factorial and Fibonacci What is B tree what is B+ tree Huffman tree in Data Structures Insertion Sort vs Bubble Sort Adding one to the number represented an array of digits Bitwise Operators and their Important Tricks Blowfish algorithm Bubble Sort vs Selection Sort Hashing and its Applications Heap Sort vs Merge Sort Insertion Sort vs Selection Sort Merge Conflicts and ways to handle them Difference between Stack and Queue AVL tree in data structure c++ Bubble sort algorithm using Javascript Buffer overflow attack with examples Find out the area between two concentric circles Lowest common ancestor in a binary search tree Number of visible boxes putting one inside another Program to calculate the area of the circumcircle of an equilateral triangle Red-black Tree in Data Structures Strictly binary tree in Data Structures 2-3 Trees and Basic Operations on them Asynchronous advantage actor-critic (A3C) Algorithm Bubble Sort vs Heap Sort Digital Search Tree in Data Structures Minimum Spanning Tree Permutation Sort or Bogo Sort Quick Sort vs Merge Sort Boruvkas algorithm Bubble Sort vs Quick Sort Common Operations on various Data Structures Detect and Remove Loop in a Linked List How to Start Learning DSA Print kth least significant bit number Why is Binary Heap Preferred over BST for Priority Queue Bin Packing Problem Binary Tree Inorder Traversal Burning binary tree Equal Sum What is a Threaded Binary Tree? What is a full Binary Tree? Bubble Sort vs Merge Sort B+ Tree Program in Q language Deletion Operation from A B Tree Deletion Operation of the binary search tree in C++ language Does Overloading Work with Inheritance Balanced Binary Tree Binary tree deletion Binary tree insertion Cocktail Sort Comb Sort FIFO approach Operations of B Tree in C++ Language Recaman’s Sequence Tim Sort Understanding Data Processing Applications of trees in data structures Binary Tree Implementation Using Arrays Convert a Binary Tree into a Binary Search Tree Create a binary search tree Horizontal and Vertical Scaling Invert binary tree LCA of binary tree Linked List Representation of Binary Tree Optimal binary search tree in DSA Serialize and Deserialize a Binary Tree Tree terminology in Data structures Vertical Order Traversal of Binary Tree What is a Height-Balanced Tree in Data Structure Convert binary tree to a doubly linked list Fundamental of Algorithms Introduction and Implementation of Bloom Filter Optimal binary search tree using dynamic programming Right side view of binary tree Symmetric binary tree Trim a binary search tree What is a Sparse Matrix in Data Structure What is a Tree in Terms of a Graph What is the Use of Segment Trees in Data Structure What Should We Learn First Trees or Graphs in Data Structures All About Minimum Cost Spanning Trees in Data Structure Convert Binary Tree into a Threaded Binary Tree Difference between Structured and Object-Oriented Analysis FLEX (Fast Lexical Analyzer Generator) Object-Oriented Analysis and Design Sum of Nodes in a Binary Tree What are the types of Trees in Data Structure What is a 2-3 Tree in Data Structure What is a Spanning Tree in Data Structure What is an AVL Tree in Data Structure Given a Binary Tree, Check if it's balanced

Balanced Binary Tree

A balanced binary tree is just a random nod-based tree with a rule of keeping its height minimum in size to maintain various operations such as insertions, deletions and several others. A balanced binary tree turns out to be one in which all the leaf nodes are at a considerable distance from the base or root nod compared to any other node in the tree. A significant amount of work is supposed to be done to keep them balanced and maintained. Balanced binary trees are also technically called height-balanced binary trees. They are generally denoted by the symbol HB(k), where we know that k stands for the difference between both the left and rt subtrees. Suppose we have a tree that contains the value of k as 0; then, the tree would be considered a fully balanced binary tree

 in that situation. 

To check whether the tree's height is balanced, we have first to get the difference between the two left and rt subtrees, and if the difference between the two is not more than one, then it will return the value true otherwise, false.

The time complexity of the balanced binary tree is known to be O(n2), and the auxiliary complexity of the same is known to be O(n) since it has recursions.


There are some well-defined conditions which we have to follow to keep the tree well-maintained. They are as follows: -

  • The subtree on the rt is supposed to be balanced.
  • The subtree on the left is supposed to be balanced.
  • The difference between both the subtrees is not more than one.


This section of the article will give examples of the implementation and working of the balanced binary tree to help you understand the concept better.

// Checking if a binary tree is a height-balanced in C++

Example 1)

using namespace std;

#define bool int

Class N {
  int item;
  nod *lft;
  nod *rt;

// Create anew nod
nod *newNod(int item) {
  nod *Nod = new nod();
  Nod->item = item;
  Nod->lft = NILL;
  Nod->rt = NILL;

  return (Nod);

// Check height balance
bool checkHeightBalance(nod *root, int *height) {
  // Check for emptiness
  int lftHeight = 0, rtHeight = 0;

  int l = 0, r = 0;

  if (root == NILL) {
    *height = 0;
    return 1;

  l = checkHeightBalance(root->lft, &lftHeight);
  r = checkHeightBalance(root->rt, &rtHeight);

  *height = (lftHeight > rtHeight ? lftHeight : rtHeight) + 1;

  if (std::abs(lftHeight - rtHeight >= 2))
    return 0;

    return l && r;

int main() {
  int height = 0;

  nod *root = newNod(1);
  root->lft = newNod(2);
  root->rt = newNod(3);
  root->lft->lft = newNod(4);
  root->lft->rt = newNod(5);

  if (checkHeightBalance(root, &height))
    cout << "The tree is balanced";
    cout << "The tree is not balanced";



Example 2)

#include <bits/stdc++.h>
using namespace std;

/* A binary tree nod has info,
pointer to lft child and
a pointer to the rt nod */
class N {
	int info;
	Nod* lft;
	Nod* rt;
	Nod(int d)
		int info = d;
		lft = rt = NILL;

// Function to calculate the height of a tree
int height(Nod* nod)
	// base case tree is empty
	if (nod == NILL)
		return 0;

	// If a tree is not empty, then
	// height = 1 + max of lft height
	// and rt heights
	return 1 + max(height(nod->lft), height(nod->rt));

// Returns true if binary tree
// with root as root is height-balanced
bool isBalanced(Nod* root)
	int lh; // for the height of lft subtree
	int rh; // for the height of rt subtree

	// If a tree is empty, then return true
	if (root == NILL)
		return 1;

	// Get the height of lft and rt subtrees
	lh = height(root->lft);
	rh = height(root->rt);

	if (abs(lh - rh) <= 1 && isBalanced(root->lft)
		&& isBalanced(root->rt))
		return 1;

	// If we reach here, then the tree is not height-balanced
	return 0;

// Driver code
int main()
	Nod* root = new Nod(1);
	root->lft = new Nod(2);
	root->rt = new Nod(3);
	root->lft->lft = new Nod(4);
	root->lft->rt = new Nod(5);
	root->lft->lft->lft = new Nod(8);

	if (isBalanced(root))
		cout << "Tree is balanced";
		cout << "Tree is not balanced";
	return 0;