/**
* 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<>>
*/
vector<vector<int> > threeOrders(TreeNode* root) {
// write code here
vector<vector<int> > resVec;
if(root == nullptr){
return resVec;
}
preOrder(root);
midOrder(root);
postOrder(root);
resVec.push_back(preVec);
resVec.push_back(midVec);
resVec.push_back(postVec);
return resVec;
}
void preOrder(TreeNode* root)
{
if(root == nullptr){
return;
}
preVec.push_back(root->val);
preOrder(root->left);
preOrder(root->right);
}
void midOrder(TreeNode* root)
{
if(root == nullptr){
return;
}
midOrder(root->left);
midVec.push_back(root->val);
midOrder(root->right);
}
void postOrder(TreeNode* root)
{
if(root == nullptr){
return;
}
postOrder(root->left);
postOrder(root->right);
postVec.push_back(root->val);
}
private:
vector<int> preVec;
vector<int> midVec;
vector<int> postVec;
};