Sum of all nodes in Binary Tree code in c++.

March 16, 2023

Sum of All Nodes in Binary Tree

In this article, we will learn the approach and code about how to calculate the sum of all nodes in binary tree in C++. Sum of all nodes can be easily calculated by traversing the array and simultaneously adding all the values of the nodes.

Sum of All Nodes in Binary Tree

In a Binary Tree, our aim is to find the sum of all nodes in the Binary tree.

The sum of all node can be found using any traversal.H ere we will be using pre-order Traversal for the same.

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

This example is a just simple extension of traversal. We will be using pre-order for implementation. However, you can try different methods also. For any doubts on Pre-order Traversal, you can refer here.

https://prepinsta.com/java-program/depth-first-traversals/

The time complexity for this in O(n)

Find the size of binary tree

Find maximum in binary tree

Level Order Traversal LIne by Line

Check If binary tree if Foldable or not

check whether tree is Symmetric

Code Implementation for finding sum of all nodes in binary tree in C++

Run

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

struct Node
{
  int val;
  Node *left;
  Node *right;
    Node (int x):val (x), left (NULL), right (NULL)
  {
  }
};

int sumOfNodes (Node * root)
{
  if (root == NULL)
    {
      return 0;
    }
  else
    {
      return root->val + sumOfNodes (root->left) + sumOfNodes (root->right);
    }
}

int main ()
{
  Node *root = new Node (1);
  root->left = new Node (2);
  root->right = new Node (3);
  root->left->left = new Node (4);
  root->left->right = new Node (5);
  root->right->left = new Node (6);
  root->right->right = new Node (7);

  int sum = sumOfNodes (root);

  cout << "The sum of all nodes in the binary tree is " << sum << "." << endl;
  return 0;
}

Output:

The sum of all nodes in the binary tree is 28.

Prime Course Trailer

Related Banners

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

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

Checkout list of all the video courses in PrepInsta Prime Subscription

Introduction to Trees

Binary Trees

Binary Tree in Data Structures (Introduction)
Tree Traversals: Inorder Postorder Preorder : C | C++ | Java
Inorder Postorder PreOrder Traversals Examples
- Inorder Tree Traversal in Binary Tree: C | C++ | Java
- Preorder Tree Traversal in Binary Tree : C | C++ | Java
- Postorder Tree Traversal in Binary Tree : C | C++ | Java
Tree Traversal without Recursion
- Postorder Preorder Inorder Traversal without recursion
- Inorder Tree Traversal without Recursion – C | C++ | Java
- Preorder Tree Traversal without Recursion – C | C++ | Java
- Postorder Tree Traversal without Recursion – C | C++ | Java

Binary Search Trees

Binary search tree in Data Structures (Introduction)
- BST: Introduction to Binary Search Tree
- BST: Binary Search Tree Program : C | C++ | Java
- BST: Search a node in Binary Search Tree : C | C++ | Java
- BST: Insertion in a Binary Search Tree : C | C++ | Java
- BST: Deletion in a Binary Search Tree : C | C++ | Java

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

B-Tree
- B-Tree: Introduction
- B-Tree: Insertion : C | C++ | Java
- B-Tree: Deletion : C | C++ | Java

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