代码随想录第十四天；LeetCode144二叉树的前序遍历；145二叉树的后序遍历；94二叉树的中序遍历

题目：144
递归法
/**

• 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:
  void traversal(TreeNode cur, vector& vec) {
  if (cur == NULL) return;
  vec.push_back(cur->val); // 中
  traversal(cur->left, vec); // 左
  traversal(cur->right, vec); // 右
  }
  vector preorderTraversal(TreeNode* root) {
  vector result;
  traversal(root, result);
  return result;
  }
  };
  迭代法
  /**
• 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 preorderTraversal(TreeNode* root) {
stack<TreeNode*>st;
vector result;
if(root==NULL) return result;
st.push(root);
while(!st.empty()){
TreeNode node=st.top();
st.pop();
result.push_back(node->val);
if(node->right) st.push(node->right);
if(node->left) st.push(node->left);
}
return result;
}
};
题目145
递归法
/*

• 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:
  void traversal(TreeNode cur,vector&vec){
  if(cur==NULL){
  return;
  }
  traversal(cur->left,vec);
  traversal(cur->right,vec);
  vec.push_back(cur->val);
  }
  vector postorderTraversal(TreeNode root) {
  vector result;
  traversal(root, result);
  return result;
  }
  };
  迭代法
  /*
• 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 postorderTraversal(TreeNode root) {
  stack<TreeNode*>st;
  vector res;
  if(root==NULL) return res;
  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;
  }

};
题目94
递归法
**

• 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:
  void traversal(TreeNode cur,vector &vec){
  if(cur==NULL) return;
  traversal(cur->left,vec);
  vec.push_back(cur->val);
  traversal(cur->right,vec);
  }
  vector inorderTraversal(TreeNode root) {
  vector res;
  traversal(root,res);
  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 inorderTraversal(TreeNode root) {
  stack<TreeNode *> st;
  vector result;
  TreeNode *cur=root;
  while(cur!=NULL||!st.empty()){
  if(cur!=NULL){
  st.push(cur);
  cur=cur->left;
  }else{
  cur=st.top();
  st.pop();
  result.push_back(cur->val);
  cur=cur->right;
  }
  }
  return result;
  }
  };