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

#include <iostream>
#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;
preTraversal(root, res);
return res;
}
static void preTraversal(TreeNode* root, vector<int> &res) {
if (!root) return;
res.push_back(root->val);
if (root->left) preTraversal(root->left, res);
if (root->right) preTraversal(root->right, res);
}

//中序遍历
static vector<int> inorderTraversal(TreeNode* root) {
vector<int> res;
inoTraversal(root, res);
return res;
}
static void inoTraversal(TreeNode* root, vector<int> &res) {
if (!root) return;
if (root->left) inoTraversal(root->left, res);
res.push_back(root->val);
if (root->right) inoTraversal(root->right, res);
}

//后序遍历
static vector<int> postorderTraversal(TreeNode* root) {
vector<int> res;
postTraversal(root, res);
return res;
}
static void postTraversal(TreeNode* root, vector<int> &res) {
if (!root) return;
if (root->left) postTraversal(root->left, res);
if (root->right) postTraversal(root->right, res);
res.push_back(root->val);
}
};

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> res = Solution::preorderTraversal(root);
for (int i : res) {
cout << i << ' ';
}
        cout<<endl;
res = Solution::inorderTraversal(root);
for (int i : res) {
cout << i << ' ';
}
        cout<<endl;
res = Solution::postorderTraversal(root); 
for (int i : res) {
cout << i << ' ';
}
cout << endl;
return 0;
}