Given a binary tree, return the postorder traversal of its nodes' values.
Example
Given binary tree {1,#,2,3}
,
1 \ 2 / 3
return [3,2,1]
.
解题思路:
递归。与前序遍历代码几乎相同,仅仅是位置不同。
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param root: A Tree
* @return: Postorder in ArrayList which contains node values.
*/
vector<int> result;
vector<int> postorderTraversal(TreeNode * root)
{
// write your code here
if(root == NULL) return result;
if(root->left != NULL)
result = postorderTraversal(root->left);
if(root->right != NULL)
result = postorderTraversal(root->right);
result.push_back(root->val);
return result;
}
};