Header Ads Widget

Develop Your Creative Skill with
Free Design Tutorials

Our blog helps to Provide Latest Tips and Tricks tutorials about Blogging
Business, SEO Tips, much more. this Blog and stay tuned to this
blog for further updates.

Binary Tree Implementation

Introduction to Binary Tree

A binary Tree is a form of Tree data structure that is connected to almost two other sub-trees containing any form of data. A binary tree is the most efficient data structure, where we can perform various operations on data in a very easier and less complex way. In a binary tree, each node is connected with at most two other children. A binary tree is a rooted tree in which numbering is done from the left side of the node. 

Binary Tree and it's Implementation

Properties of Binary Trees

  1. The maximum height of a Binary Tree having N nodes is N.
  2. The Minimum height of a Binary Tree having n nodes is Log2N.
  3. Maximum Nodes in a Binary Tree is (2h-1), where 'h'  is the height of the Binary Tree.
  4. Each Node has two or no child nodes.
  5. In No-Empty Binary Tree ( Number of Nodes = Number of edges +1).

Application of Binary Tree

  1. Binary Tree Organize hierarchical data in efficient order.
  2. A binary Tree is helpful in searching insertion and deletion when data is very large.
  3. Binary Tree is used in Network Routing Algorithms.
  4. Binary Tree is used in 3D video games for rendering objects.
  5. Binary Tree is used in the compression of .jpeg and.mp3 files.
  6. Router Algorithm.

Balanced Binary Tree

A balanced Binary Tree is a tree whose difference between the height of left and right subtree for every Node is not more than K(Mostly K=1).

Implementation of Binary Tree

Implementation of Binary Tree can be done in two ways:
  • Using Dynamically Created Node
  • Using Arrays

Implementation of Binary Tree using Dynamically created node is more efficient than using Arrays.

Implementation of Binary Tree in C++

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

class Node {
int data;
Node* left;
Node* right;

Node(int val)
data = val;

left = NULL;
right = NULL;

int main()

Node* root = new Node(1);

root->left = new Node(2);
root->right = new Node(3);
root->left->left = new Node(4);

return 0;

Implementation of Binary Tree in Java

import java.util.*;

public class MyTree {
    static Scanner sc=null;

    public static void main(String[] args) {
        // TODO Auto-generated method stub
    sc=new Scanner(System.in);
            Nodel root =CreateTree();

    static Nodel CreateTree()
        Nodel root=null;
        System.out.println("Enter the Number : ");
        int data=sc.nextInt();
        if(data==-1) { return null;}
        root= new Nodel(data);
        System.out.println("Enter the element left of " + data);
        System.out.println("Enter the element Right of " + data);
        return root;
    public static void inOrder(Nodel root)
public  static void preOrder(Nodel root)
    public static void postOrder(Nodel root)

class Nodel 
    Nodel left ,right;
    int data;
    public Nodel(int data)

Types of Transversal in Binary Tree

There are mainly three types of tranversal in Binary Tree
  • Inorder Transversal
  • Postorder Transversal
  • PreOrder Transversal
we will discuss about these transversal in our upcoming Blogs so stay tuned with us.