Description:
题目大意:二叉树后序遍历
解题思路:
算法标签:二叉树,后序遍历
代码:
/**
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* };
*/
class Solution {
public:
vector<int> ans;
void postordervisited(TreeNode* root) {
if(root == NULL)
return;
postordervisited(root -> left);
postordervisited(root -> right);
ans.push_back(root -> val);
}
vector<int> postorderTraversal(TreeNode* root) {
postordervisited(root);
return ans;
}
};