题目要求为遍历树中所有的节点,计算每个节点内数值之和。
开始使用的是递归遍历,不过发现这样会将计算过程中的每一步的和都返回,想了半天还是不知道怎么解决。于是采取了非递归的方法,也是之前提到过的使用了一个queue的数据结构来遍历所有的节点。目前唯一不明白的是为什么要把计算总和的number定义在函数内部,之前WA了好多次都是因为把number的初始化放到了函数之外。
代码如下,把与上文图片对应的主函数也贴上吧,刚才测试时顺便写上了。
#include<iostream>
#include<queue>
#include<string>
using namespace std;
struct BinaryNode
{
string name;
int size;
BinaryNode *left;
BinaryNode *right;
BinaryNode( const string & n = "", int s = 0, BinaryNode *lt =NULL, BinaryNode *rt =NULL )
: name(n), size(s), left( lt ), right( rt ) { };
};
queue<const BinaryNode*>sum_of_node;
int sum(const BinaryNode*root)
//returns the total size of the file structure of root, assuming an internal node is a folder and a leaf is a file.
{
if (root== NULL)
return 0;
int number = 0;
sum_of_node.push(root);
number += sum_of_node.front()->size;
while (!sum_of_node.empty()) {
if (sum_of_node.front()->left != NULL) {
sum_of_node.push(sum_of_node.front()->left);
number += sum_of_node.front()->left->size;
}
if (sum_of_node.front()->right != NULL) {
sum_of_node.push(sum_of_node.front()->right);
number += sum_of_node.front()->right->size;
}
sum_of_node.pop();
}
//cout<<number<<endl;
return number;
}
int main() {
BinaryNode *root = NULL;
root = new BinaryNode;
root->size = 0;
root->size = 12;
root->left = new BinaryNode;
root->left->size = 26;
root->right = new BinaryNode;
root->right->size = 12;
root->right->left = new BinaryNode;
root->right->left->size = 24;
root->right->right = new BinaryNode;
root->right->right->size = 36;
int i = sum(root);
//cout<<i<<endl;
return 0;
}