（树_17）树的前中后序遍历以及统一写法

参考：代码随想录、统一写法

144. 二叉树的前序遍历

145. 二叉树的后序遍历

94. 二叉树的中序遍历

/**前序遍历
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> preorderTraversal(TreeNode* root) {
      if(root == nullptr) return {};
      vector<int> res;

      stack<TreeNode*> st;
      st.push(root);
      while(!st.empty()){
          TreeNode *node = st.top();
          st.pop();

          res.push_back(node->val);
          if(node->right) st.push(node->right);
          if(node->left) st.push(node->left);
      }
      return res;
        
    }
};

 

/**后序遍历迭代法
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        if(root == nullptr) return{};
        vector<int> res;
        stack<TreeNode*> st;
        st.push(root);
        while(!st.empty()){
            TreeNode* node = st.top();
            st.pop();
           
            res.push_back(node->val);
            if(node->left) st.push(node->left);
            if(node->right) st.push(node->right);
        }
        reverse(res.begin(), res.end());
        return res;
    }
};

/**中序遍历非递归：左中右
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
       if(root == nullptr) return {};
       vector<int> res;
       TreeNode *cur = root;
       stack<TreeNode*> st;
       
       while(cur != nullptr || !st.empty()){
           if(cur != nullptr){
               st.push(cur);
               cur = cur->left;
           }else{
               cur = st.top();
               st.pop();

               res.push_back(cur->val);

               cur = cur->right;
           }
       }
       return res;
    }
};