Question

C++ Data Structures and Algorithms

Binary Trees: Implementation

Answer the following question(s) concerning implementing recursive functions to perform operations on linked lists of nodes arranged as binary trees. For these questions, use the following struct definition for the nodes of the tree (we will not templatize the node here, so you do not have to write template functions for these questions, just assume trees of <int>values):

struct BinaryTreeNode

{ int item; BinaryTreeNode* left;

BinaryTreeNode* right;

};

Write a recursive function that sums up all of the values in the binary tree. The base case is that the sum is 0 for an empty tree (or when you reach a NULL node), otherwise you add the item value of the current node to the sum you get for the left and right subtrees of this node.

The function signature for the recursive function should be the following:

/** sum tree values

* Sum up the values in all of the nodes of the given tree and return

* this sum.

* * @param node The node of the tree we are to calculate the sum for. The root * of a tree can be given initally to calculate the sum for the whole tree.

* * @returns int Returns the sum of the tree given as input for this function.

*/

int sumOfTree(BinaryTreeNode* node)

{

}

Answer 1

Solution:

Contains only the required function...

Code:

/*
* Sum tree values
* Sum up the values in all of the nodes of the given tree and return
* this sum.
*
* @param node The node of the tree we are to calculate the sum for.
* The root of a tree can be given initally to calculate the sum
* for the whole tree.
*
* @returns: int Returns the sum of the tree given as input for
* this function.
*/

struct BinaryTreeNode
{
    int item; BinaryTreeNode* left;
    BinaryTreeNode* right;
};

int sumOfTree(BinaryTreeNode* node)
{
    if (root == NULL) //Checking the base case..
        return 0;     

    //Recursive function call..
    return (root->data + sumOfTree(root->left) + sumOfTree(root->right)) ;
}

//Adding the Root->data with the all the nodes-> data..
//At each recursion call root->left and root->right will become the
//root node for that current iteration..

//Above program is checked and executed successfully..
//Gives the exact sum as output as expected..

-----------------------------------------------------------------------

Code screenshots:

------------------------------------------------------------------------

Please comment if you have any queries or changes required in this solution..

Kindly up-vote if you are satisfied with this solution..