144二叉树的前序遍历

用递归就按书上的来就行，题解也提供了迭代的方法，太麻烦。

#include<iostream>
#include<vector>
using namespace std;
struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode() : val(0), left(nullptr), right(nullptr) {}
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
class Solution {
public:
    void preorder(TreeNode* root, vector<int>& res) {
        if (root == nullptr) {
            return;
        }
        res.push_back(root->val);
        preorder(root->left, res);
        preorder(root->right, res);
    }

    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> res;
        preorder(root, res);
        return res;
    }
};
int main() {
    Solution test;
    TreeNode* c = new TreeNode(3);
    TreeNode* b = new TreeNode(2, c, nullptr);
    TreeNode* a = new TreeNode(1, nullptr, b);
    vector<int>ans = test.preorderTraversal(a);
    for (int i = 0; i < ans.size(); i++) {
        cout << ans[i];
    }
}