/**
* 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:
vector<int> postorderTraversal(TreeNode* root)
{
vector<int> res;
if(root == NULL)
return res;
goleft(root,res);
return res;
}
void goleft(TreeNode *root,vector<int> &res)
{
if(root->left != NULL)
goleft(root->left,res);
if(root->right != NULL)
goleft(root->right,res);
res.push_back(root->val);
}
};
算法思想:
用递归的方法做的,和前序遍历的区别就是改了一下位置。