Consider the following definition for an n-ary tree node. cl…

Consider the following definition for an n-ary tree node. class Node {    public:        int value;        std::vector children;       Node (int value){           this->value = value;        }        void addChild(Node* child){            this->children.push_back(child);        }}; A sum tree is an n-ary tree of positive integers such that for any non-leaf node, its value is the sum of all values for the subtree rooted at said node. We consider null nodes to have a value of zero, and define an empty tree to be a valid sum tree.For instance, the following is a valid sum tree.While the tree depicted below is not. Namely, the node with the value of 7 is not the sum of the values of the nodes of its subtree, nor is the node with the value 48, or in turn the root with value 129. Problem Statement: Given the root of an n-ary tree write a function using pseudocode or C++ code that takes as input a prebuilt n-ary tree and returns a boolean that signifies if the tree is a valid sum tree. Have your algorithm output `true` if the tree is a valid sum tree or `false` otherwise.  In the text entry box, please switch from Paragraph mode to Preformatted mode to make your answer easier to read. Use spaces, not tabs, for indentation.
Continue reading “Consider the following definition for an n-ary tree node. cl…”…