利用队列,入队出队按层输出
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
};
void FloorTraversal(TreeNode* root, std::vector<int>& res)
{
std::queue<TreeNode*> q;
q.push(root);
while (!q.empty()) {
root = q.front();
q.pop();
res.push_back(root->val);
if (root->left) q.push(root->left);
if (root->right) q.push(root->right);
}
}
int main()
{
TreeNode* n1 = new TreeNode(1);
TreeNode* n2 = new TreeNode(2);
TreeNode* n3 = new TreeNode(3);
TreeNode* n4 = new TreeNode(4);
TreeNode* n5 = new TreeNode(5);
TreeNode* n6 = new TreeNode(6);
TreeNode* n7 = new TreeNode(7);
n1->left = n2;
n1->right = n5;
n2->left = n3;
n2->right = n4;
n5->left = n6;
n5->right = n7;
std::vector<int> res;
FloorTraversal(n1, res);
std::copy(res.begin(), res.end(), std::ostream_iterator<int>(std::cout, " "));
std::cout << std::endl;
}