二叉树的遍历

• 递归遍历
• 144.二叉树的前序遍历|145.二叉树的后序遍历|94.二叉树的中序遍历

/**
 * Definition for a binary tree node.
 * 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 preSearch(TreeNode* p, vector<int>& res) {
        if (p == nullptr)   return;
        res.push_back(p->val);
        preSearch(p->left, res);
        preSearch(p->right, res);
    }
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> res;
        preSearch(root, res);
        return res;
    }
};

• 迭代法，过后来补