实现二叉树的先序、中序、后序遍历

题目描述

分别按照二叉树先序，中序和后序打印所有的节点。

示例1

输入

{1,2,3}

输出

[[1,2,3],[2,1,3],[2,3,1]]

/**
 * 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 travel_deep(TreeNode* root, vector<vector<int>> &res){
        if(root){
            res[0].push_back(root->val);
            travel_deep(root->left, res);
            res[1].push_back(root->val);
            travel_deep(root->right, res);
            res[2].push_back(root->val);
        }
    }
    vector<vector<int> > threeOrders(TreeNode* root) {
        // write code here
        vector<vector<int>> res(3);
        travel_deep(root, res);
        return res;
    }
};