2021-10-24前序中序后序遍历二叉树

也没啥技巧就是注意怎么把结果腾出来这里用了引用设定好的数组的方法。

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 * };
 */

class Solution {
public:
    /**
     * 
     * @param root TreeNode类 the root of binary tree
     * @return int整型vector<vector<>>
     */
     //中序
    void midOrder(vector<int> &res,TreeNode* root){
        if(!root) return ;
        midOrder(res,root->left);
        res.push_back(root->val);
        midOrder(res, root->right);
    }
    //前序
    void preOrder(vector<int> &res,TreeNode* root){
        if(!root) return ;
        res.push_back(root->val);
        preOrder(res,root->left);
        preOrder(res, root->right);
    }
    //后序
    void postOrder(vector<int> &res,TreeNode* root){
        if(!root) return ;
        postOrder(res,root->left);
        postOrder(res, root->right);
        res.push_back(root->val);
    }
    vector<vector<int> > threeOrders(TreeNode* root) {
        // write code here
        vector<vector<int> >res(3);
        preOrder(res[0],root);
        midOrder(res[1],root);
        postOrder(res[2],root);
        return res;
    }
};