用C++实现的二叉树非递归遍历算法

#include <vector>  
#include <stack>  
using namespace std;

struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {
}
};

class Solution {
public:
//前序遍历
static vector<int> preorderTraversal(TreeNode* root) {
vector<int> res;
stack<TreeNode*> temp;
while (root || !temp.empty()) {
while (root) {
temp.push(root);
res.push_back(root->val);
root = root->left;
}
root = temp.top();
temp.pop();
root = root->right;
}
return res;
}

//中序遍历
static vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
stack<TreeNode*> temp;
while (root || !temp.empty()) {
while (root) {
temp.push(root);
root = root->left;
}
root = temp.top();
temp.pop();
res.push_back(root->val);
root = root->right;
}
return res;
}

//后序遍历
static vector<int> postorderTraversal(TreeNode* root) {
vector<int> res;
stack<TreeNode*> temp;
while (root || !temp.empty()) {
while (root) {
temp.push(root);
res.insert(res.begin(), root->val);
root = root->right;
}
root = temp.top();
temp.pop();
root = root->left;
}
return res;
}
};

int main() {
TreeNode * root = NULL;
root = new TreeNode(0);
root->left = new TreeNode(1);
root->right = new TreeNode(2);
root->left->left = new TreeNode(3);
root->left->right = new TreeNode(4);
root->right->left = new TreeNode(5);
root->right->right = new TreeNode(6);
vector<int> result = Solution::preorderTraversal(root);
for (int i : result) {
printf("%d, ", i);
}
printf("\n");
result = Solution::inorderTraversal(root);
for (int i : result) {
printf("%d, ", i);
}
printf("\n");
result = Solution::postorderTraversal(root);
for (int i : result) {
printf("%d, ", i);
}
printf("\n");
return 0;
}