题解 | #二叉树的前序遍历#

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @return int整型vector
     */
    vector<int> preorderTraversal(TreeNode* root) {
        std::vector<int> res; res.reserve(100);
        auto pre = [&res](auto&& _pre, TreeNode* n) -> void {
            if(not n) return;
            res.push_back(n->val);
            _pre(_pre, n->left);
            _pre(_pre, n->right);
        };
        pre(pre, root);
        return res;
    }
};