题目:给出一棵二叉树,返回其节点值的后序遍历。
样例:
给出一棵二叉树 {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.
*/
void post(vector<int> &v,TreeNode *root)
{
if(root==NULL) return;
else {
post(v,root->left);
post(v,root->right);
v.push_back(root->val);
}
}
public:
vector<int> postorderTraversal(TreeNode *root) {
// write your code here
vector<int> v;
post(v,root);
return v;
}
};
感想:同前序中序遍历一样。