LeetCode题解之Binary Tree Postorder Traversal

1、题目描述

2、问题分析

递归

3、代码

 vector<int> postorderTraversal(TreeNode* root) {
         vector<int> v;
         postBorder(root,v);
         return v;
     }

     void postBorder(TreeNode *root, vector<int> &v)
     {
         if (root == NULL)
             return ;
         postBorder(root->left, v);
         postBorder(root->right, v);
         v.push_back(root->val);
     }