给出一棵二叉树,返回其节点值的后序遍历。
给出一棵二叉树 {1,#,2,3},
1
\
2
/
3
返回 [3,2,1]
class Solution {
/**
* @param root: The root of binary tree.
* @return: Postorder in vector which contains node values.
*/
public:
vector<int> a;
void look(TreeNode *root)
{
if(root==NULL)
return ;
look(root->left);
look(root->right);
a.push_back(root->val);
}
vector<int> postorderTraversal(TreeNode *root) {
look(root);
return a;
// write your code here
}
};
写一个递归函数,将每一次遍历的节点放在vector里,后序遍历完成后,将vector里的值输出即可