代码随想录算法训练营第十四天|144. 二叉树的前序遍历、94. 二叉树的中序遍历、145. 二叉树的后序遍历

Leetcode 144. 二叉树的前序遍历
思路:二叉树的前序遍历题，遍历顺序是中左右

/**
 * 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 traversal(TreeNode* root, vector<int>& vec){
        if(root==NULL)return ; //遍历到空节点停止遍历
        vec.push_back(root->val); //中
        traversal(root->left,vec); //左
        traversal(root->right,vec); //右
    }
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> res;
        traversal(root,res);
        return res;
    }
};

Leetcode 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 traversal(TreeNode* root, vector<int>& vec){
        if(root==NULL)return ; //遍历到空节点停止遍历 
        traversal(root->left,vec); //左
        vec.push_back(root->val); //中
        traversal(root->right,vec); //右
    }
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> res;
        traversal(root,res);
        return res;
    }
};

Leetcode 145. 二叉树的后序遍历
思路：二叉树的后序遍历题，遍历顺序是左右中

/**
 * 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 traversal(TreeNode* root, vector<int>& vec){
        if(root==NULL)return ; //遍历到空节点停止遍历 
        traversal(root->left,vec); //左
        traversal(root->right,vec); //右
        vec.push_back(root->val); //中
    }
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> res;
        traversal(root,res);
        return res;
    }
};