Skip to content
Related Articles

Related Articles

Improve Article

Product of all nodes in a Binary Tree

  • Difficulty Level : Easy
  • Last Updated : 28 May, 2021

Given a Binary Tree. The task is to write a program to find the product of all of the nodes of the given binary tree.
 

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.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

In the above binary tree, 
Product = 15*10*8*12*20*16*25 = 115200000
 



The idea is to recursively: 
 

  • Find the product of the left subtree.
  • Find the product of the right subtree.
  • Multiply the product of left and right subtrees with the current node’s data and return.

Below is the implementation of the above approach: 
 

C++




// Program to print product of all
// the nodes of a binary tree
#include <iostream>
using namespace std;
 
// Binary Tree Node
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 product of
// all the nodes
int productBT(Node* root)
{
    if (root == NULL)
        return 1;
 
    return (root->key * productBT(root->left) * productBT(root->right));
}
 
// Driver Code
int main()
{
    // Binary Tree is:
    //       1
    //      /  \
    //     2    3
    //    / \  / \
    //   4   5 6  7
    //          \
    //           8
    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 prod = productBT(root);
 
    cout << "Product of all the nodes is: "
         << prod << endl;
 
    return 0;
}
Java



   
// Java Program to print product of all
// the nodes of a binary tree
import java.util.*;
class solution
{
 
// Binary Tree Node
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 product of
// all the nodes
static int productBT(Node root)
{
    if (root == null)
        return 1;
 
    return (root.key * productBT(root.left) * productBT(root.right));
}
 
// Driver Code
public static void main(String args[])
{
    // Binary Tree is:
    //       1
    //      /  \
    //     2    3
    //    / \  / \
    //   4   5 6  7
    //          \
    //           8
    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 prod = productBT(root);
 
    System.out.println( "Product of all the nodes is: "+prod);
 
}
}
//contributed by Arnab Kundu
Python3



# Python3 Program to print product of
# all the nodes 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 product of
# all the nodes
def productBT( root) :
 
    if (root == None):
        return 1
 
    return (root.key * productBT(root.left) *
                       productBT(root.right))
 
# Driver Code
if __name__ == '__main__':
     
    # Binary Tree is:
    #     1
    #     / \
    #     2 3
    # / \ / \
    # 4 5 6 7
    #         \
    #         8
    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)
 
    prod = productBT(root)
 
    print("Product of all the nodes is:", prod)
     
# This code is contributed by
# Shubham Singh(SHUBHAMSINGH10)
C#



// C# Program to print product of all
// the nodes of a binary tree
using System;
 
class GFG
{
 
    // Binary Tree Node
    class Node
    {
        public int key;
        public 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 product of
    // all the nodes
    static int productBT(Node root)
    {
        if (root == null)
            return 1;
 
        return (root.key * productBT(root.left) *
                        productBT(root.right));
    }
 
    // Driver Code
    public static void Main()
    {
        // Binary Tree is:
        //     1
        //     / \
        //     2 3
        // / \ / \
        // 4 5 6 7
        //         \
        //         8
        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 prod = productBT(root);
 
        Console.WriteLine( "Product of all " +
                        "the nodes is: " + prod);
    }
}
 
/* This code is contributed PrinciRaj1992 */
Javascript



   
<script>
// javascript Program to prvar product of all
// the nodes of a binary tree
// Binary Tree Node
class Node {
    constructor(val) {
        this.key = val;
        this.left = null;
        this.right = null;
    }
}
/* utility that allocates a new Node
   with the given key */
function newNode(key)
{
    var node = new Node();
    node.key = key;
    node.left = node.right = null;
    return (node);
}
 
// Function to find product of
// all the nodes
function productBT(root)
{
    if (root == null)
        return 1;
 
    return (root.key * productBT(root.left) * productBT(root.right));
}
 
// Driver Code
 
    // Binary Tree is:
    //       1
    //      /  \
    //     2    3
    //    / \  / \
    //   4   5 6  7
    //          \
    //           8
    var 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);
 
    var prod = productBT(root);
 
    document.write( "Product of all the nodes is: "+prod);
 
// This code contributed by gauravrajput1
</script>
Javascript



   
<script>
// javascript Program to prvar product of all
// the nodes of a binary tree
// Binary Tree Node
class Node {
    constructor(val) {
        this.key = val;
        this.left = null;
        this.right = null;
    }
}
 
/* utility that allocates a new Node
   with the given key */
function newNode(key)
{
    var node = new Node();
    node.key = key;
    node.left = node.right = null;
    return (node);
}
 
// Function to find product of
// all the nodes
function productBT(root)
{
    if (root == null)
        return 1;
 
    return (root.key * productBT(root.left) * productBT(root.right));
}
 
// Driver Code
 
    // Binary Tree is:
    //       1
    //      /  \
    //     2    3
    //    / \  / \
    //   4   5 6  7
    //          \
    //           8
    var 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);
 
    var prod = productBT(root);
 
    document.write( "Product of all the nodes is: "+prod);
 
// This code contributed by umadevi9616
</script>
Output: 
 
Product of all the nodes is: 40320
Time complexity : O(n)
 



My Personal Notes
arrow_drop_up
Previous
Sum of all odd frequency elements in a Matrix
Next

Numbers in range [L, R] such that the count of their divisors is both even and prime
Recommended Articles
Page :
Product of all leaf nodes of binary tree
27, Oct 18
Print Sum and Product of all Non-Leaf nodes in Binary Tree
29, Oct 18
Modify Binary Tree by replacing each node with the product of all remaining nodes
13, May 21
Count the nodes of the tree which make a pangram when concatenated with the sub-tree nodes
28, May 19
Complexity of different operations in Binary tree, Binary Search Tree and AVL tree
19, Jan 18
Count of all prime weight nodes between given nodes in the given Tree
16, May 20
Construct a Tree whose sum of nodes of all the root to leaf path is not divisible by the count of nodes in that path
19, Mar 21
Min-Max Product Tree of a given Binary Tree
11, Jun 20
Construct XOR tree by Given leaf nodes of Perfect Binary Tree
13, Jan 20
Convert given Binary Tree to Symmetric Tree by adding minimum number of nodes
15, Oct 21
Remove all leaf nodes from a Generic Tree or N-ary Tree
25, Jul 20
Print all nodes in a binary tree having K leaves
22, Dec 16
Print all full nodes in a Binary Tree
02, Apr 17
Sum of heights of all individual nodes in a binary tree
01, Mar 18
Find sum of all nodes of the given perfect binary tree
21, Mar 18
Convert a Binary Tree such that every node stores the sum of all nodes in its right subtree
20, Jun 18
Print all even nodes of Binary Search Tree
29, Oct 18
Print path from root to all nodes in a Complete Binary Tree
03, Apr 19
Connect all nodes to their Left Neighbors in a Binary Tree
18, Apr 19
Sum of all the child nodes with even parent values in a Binary Tree
15, Jan 20
Print all nodes except rightmost node of every level of the Binary Tree
13, Mar 20
Sum of all nodes at Kth level in a Binary Tree
14, Feb 20
Sum of all the child nodes with even grandparents in a Binary Tree
16, May 20
Check if all the Nodes in a Binary Tree having common values are at least D distance apart
11, Aug 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
VishalBachchas
@VishalBachchas
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox