Give an algorithm for finding the sum of all elements in a binary tree.
In the above binary tree sum = 106.
The idea is to recursively, call left subtree sum, right subtree sum and add their values to current node’s data.
C++
/* Program to print sum of all the elements of a binary tree */#include <bits/stdc++.h> using namespace std; struct Node { int key; Node* left, *right; }; /* utility that allocates a new Node with the given key */Node* newNode(int key) { Node* node = new Node; node->key = key; node->left = node->right = NULL; return (node); } /* Function to find sum of all the elements*/int addBT(Node* root) { if (root == NULL) return 0; return (root->key + addBT(root->left) + addBT(root->right)); } /* Driver program to test above functions*/int main() { Node* root = newNode(1); root->left = newNode(2); root->right = newNode(3); root->left->left = newNode(4); root->left->right = newNode(5); root->right->left = newNode(6); root->right->right = newNode(7); root->right->left->right = newNode(8); int sum = addBT(root); cout << "Sum of all the elements is: " << sum << endl; return 0; } |
chevron_right
filter_none
Java
// Java Program to print sum of // all the elements of a binary tree class GFG { static class Node { int key; Node left, right; } /* utility that allocates a new Node with the given key */static Node newNode(int key) { Node node = new Node(); node.key = key; node.left = node.right = null; return (node); } /* Function to find sum of all the elements*/static int addBT(Node root) { if (root == null) return 0; return (root.key + addBT(root.left) + addBT(root.right)); } // Driver Code public static void main(String args[]) { Node root = newNode(1); root.left = newNode(2); root.right = newNode(3); root.left.left = newNode(4); root.left.right = newNode(5); root.right.left = newNode(6); root.right.right = newNode(7); root.right.left.right = newNode(8); int sum = addBT(root); System.out.println("Sum of all the elements is: " + sum); } } // This code is contributed by Arnab Kundu |
chevron_right
filter_none
Python3
# Python3 Program to print sum of all # the elements of a binary tree # Binary Tree Node """ utility that allocates a new Node with the given key """class newNode: # Construct to create a new node def __init__(self, key): self.key = key self.left = None self.right = None # Function to find sum of all the element def addBT(root): if (root == None): return 0 return (root.key + addBT(root.left) + addBT(root.right)) # Driver Code if __name__ == '__main__': root = newNode(1) root.left = newNode(2) root.right = newNode(3) root.left.left = newNode(4) root.left.right = newNode(5) root.right.left = newNode(6) root.right.right = newNode(7) root.right.left.right = newNode(8) sum = addBT(root) print("Sum of all the nodes is:", sum) # This code is contributed by # Shubham Singh(SHUBHAMSINGH10) |
chevron_right
filter_none
C#
using System; // C# Program to print sum of // all the elements of a binary tree public class GFG { public class Node { public int key; public Node left, right; } /* utility that allocates a new Node with the given key */public static Node newNode(int key) { Node node = new Node(); node.key = key; node.left = node.right = null; return (node); } /* Function to find sum of all the elements*/public static int addBT(Node root) { if (root == null) { return 0; } return (root.key + addBT(root.left) + addBT(root.right)); } // Driver Code public static void Main(string[] args) { Node root = newNode(1); root.left = newNode(2); root.right = newNode(3); root.left.left = newNode(4); root.left.right = newNode(5); root.right.left = newNode(6); root.right.right = newNode(7); root.right.left.right = newNode(8); int sum = addBT(root); Console.WriteLine("Sum of all the elements is: " + sum); } } // This code is contributed by Shrikant13 |
chevron_right
filter_none
Output:
Sum of all the elements is: 36
This article is contributed by Prakriti Gupta. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Count the nodes of the tree which make a pangram when concatenated with the sub-tree nodes
- Complexity of different operations in Binary tree, Binary Search Tree and AVL tree
- Change a Binary Tree so that every node stores sum of all nodes in left subtree
- Sum of all leaf nodes of binary tree
- Sum of heights of all individual nodes in a binary tree
- Find sum of all nodes of the given perfect binary tree
- Convert a Binary Tree such that every node stores the sum of all nodes in its right subtree
- Print Sum and Product of all Non-Leaf nodes in Binary Tree
- Sum of all the Boundary Nodes of a Binary Tree
- Maximum sum of leaf nodes among all levels of the given binary tree
- Maximum sum of non-leaf nodes among all levels of the given binary tree
- Sum of all the child nodes with even parent values in a Binary Tree
- Sum of all nodes at Kth level in a Binary Tree
- Sum of all the child nodes with even grandparents in a Binary Tree
- Check if all nodes of the Binary Tree can be represented as sum of two primes
- Count of all prime weight nodes between given nodes in the given Tree
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
- Construct XOR tree by Given leaf nodes of Perfect Binary Tree
- Sum of all odd nodes in the path connecting two given nodes
- Remove all leaf nodes from a Generic Tree or N-ary Tree
