Sum of all Nodes in a Binary Tree

April 11, 2023

Sum of all Nodes Of a Binary Tree in Java

In a Binary Tree, our aim is to find the sum of all nodes in a Binary tree.The sum of all node can be found using any traversal.Here we will be using Inorder Traversal for the same.You can do this from Pre Order or PostOrder as well.

We just need to traverse the tree and maintain a sum value and keep adding each time a new value is found.

Sum of all Nodes of a binary tree

Sum of all Nodes in a Binary Tree

Algorithm :

  • Create a function called calculateSum() to calculate the sum of nodes in a binary tree.
  • Check if the root is null (indicating an empty tree).
  • If the tree is not empty, traverse the left subtree and calculate the sum of nodes, storing it in a variable called sumLeft.
  • Traverse the right subtree and calculate the sum of nodes, storing it in a variable called sumRight.
  • Calculate the total sum as the sum of the root’s data, sumLeft, and sumRight.
  • Return the total sum as the result.
Sum of all Nodes of Binary tree
DSA desktop gif
DSA mobile gif

Find size of the Binary tree

Find the height of binary tree

Find maximum in binary tree

Check for Children-Sum in Binary Tree

check whether tree is Symmetric

Code in Java to find Sum of all nodes in a binary tree

Run 
import java.util.*;

class Node {
    int data;
    Node left, right;

    public Node(int d) {
        data = d;
        left = right = null;
    }
    public Node() {
        data = 0;
        left = right = null;
    }
}

class BTree {
    Node root;

    /* returns sum of all nodes */
    public int sumBT(Node root) {
        if (root == null)
            return 0;
        int sum = 0;
        sum += sumBT(root.left);
        sum += root.data;
        sum += sumBT(root.right);
        return sum;
    }
}
public class Main{

    public static void main(String[] args) {
        BTree tree = new BTree();
        tree.root = new Node(10);
        tree.root.left = new Node(5);
        tree.root.right = new Node(2);
        tree.root.left.left = new Node(7);
        tree.root.left.right = new Node(5);
        tree.root.right.right = new Node(1);
        System.out.println("The sum of all nodes of tree are " + tree.sumBT(tree.root));

    }
}

Output

The sum of all nodes of tree are 30.

Prime Course Trailer

Related Banners

Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription

Get Prime

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others

Get Prime
Course List
Course List

Checkout list of all the video courses in PrepInsta Prime Subscription

Checkout list of all the video courses in PrepInsta Prime Subscription

Checkout
Checkout

Introduction to Trees

Binary Trees

Binary Search Trees

Traversals

  • Traversal in Trees
  • Tree Traversals: Breadth-First Search (BFS) : C | C++ | Java
  • Tree Traversals: Depth First Search (DFS) : C | C++ | Java
  • Construct a Binary Tree from Postorder and Inorder

B – Trees

AVL Trees

  • AVL Trees
    • AVL Trees: Introduction
    • AVL Tree Insertion : C | C++ | Java
    • AVL Tree Deletion : C | C++ | Java
    • Insertion in a Binary Tree (Level Order) – C | C++ | Java
    • Searching in Binary Tree – C | C++ | Java
    • Searching in a Binary Search Tree – C | C++ | Java

Complete Programs for Trees

  • Depth First Traversals – C | C++ | Java
  • Level Order Traversal – C | C++ | Java
  • Construct Tree from given Inorder and Preorder traversals – C | C++ | Java
  • Construct Tree from given Postorder and Inorder traversals – C | C++ | Java
  • Construct Tree from given Postorder and Preorder traversal – C | C++ | Java
  • Find size of the Binary tree – C | C++ | Java
  • Find the height of binary tree – C | C++ | Java
  • Find maximum in binary tree – C | C++ | Java
  • Check whether two tree are identical- C| C++| Java
  • Spiral Order traversal of Tree- C | C++| Java
  • Level Order Traversal Line by Line – C | C++| Java
  • Hand shaking lemma and some Impotant Tree Properties.
  • Check If binary tree if Foldable or not.- C| C++| Java
  • check whether tree is Symmetric – C| C++| Java.
  • Check for Children-Sum in Binary Tree- C|C++| Java
  • Sum of all nodes in Binary Tree- C | C++ | Java
  • Lowest Common Ancestor in Binary Tree- C | C++ | Java

Introduction to Trees

Binary Trees

Binary Search Trees

Traversals

  • Traversal in Trees
  • Tree Traversals: Breadth-First Search (BFS) : C | C++ | Java
  • Tree Traversals: Depth First Search (DFS) : C | C++ | Java
  • Construct a Binary Tree from Postorder and Inorder

B – Trees

AVL Trees

  • AVL Trees
    • AVL Trees: Introduction
    • AVL Tree Insertion :  C | C++ | Java
    • AVL Tree Deletion : C | C++ | Java
    • Insertion in a Binary Tree (Level Order) – C | C++ | Java
    • Searching in Binary Tree – C | C++ | Java
    • Searching in a Binary Search Tree – C | C++ | Java

Complete Programs for Trees

  • Depth First Traversals – C | C++ | Java
  • Level Order Traversal – C | C++ | Java
  • Construct Tree from given Inorder and Preorder traversals – C | C++ | Java
  • Construct Tree from given Postorder and Inorder traversals – C | C++ | Java
  • Construct Tree from given Postorder and Preorder traversal – C | C++ | Java
  • Find size of the Binary tree – C | C++ | Java
  • Find the height of binary tree – C | C++ | Java
  • Find maximum in binary tree – C | C++ | Java
  • Check whether two tree are identical- C| C++| Java
  • Spiral Order traversal of Tree- C | C++| Java
  • Level Order Traversal LIne by Line – C | C++| Java
  • Hand shaking lemma and some Impotant Tree Properties.
  • Check If binary tree if Foldable or not.- C| C++| Java
  • check whether tree is Symmetric  C| C++| Java.
  • Check for Children-Sum in Binary Tree- C|C++| Java
  • Sum of all nodes in Binary Tree- C | C++ | Java
  • Lowest Common Ancestor in Binary Tree. C | C++ | Java