【数据结构与算法】二叉树的遍历方法总结

先序遍历

递归版

非递归版

中序遍历

递归版

非递归版

后序遍历

递归版

非递归版

层序遍历

#include<iostream>
#include<queue>
#include<vector>
using namespace std;
struct TreeNode {
      int val;
      TreeNode *left;
      TreeNode *right;
      TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
    vector<int> levelOrder(TreeNode* root) {
        vector<int> ans;
        if (root == nullptr) return ans;
        queue<TreeNode*> q;
        q.push(root);//将根结点root加入队列q
        while (!q.empty()) {
            TreeNode* front = q.front();//取出队首结点，访问它
            ans.push_back(front->val);
            q.pop();//弹出
            if (front->left != nullptr) q.push(front->left);//左子树不为空，压入左子树
            if (front->right != nullptr) q.push(front->right);//右子树不为空，压入右子树
        }
        return ans;
    }
};

树的层次遍历

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> ans;
        if (root == nullptr) return ans;
        queue<TreeNode*> q;
        q.push(root);
        while (!q.empty()) {
            vector<int> temp;
            int len = q.size();//这里的size要提前拿，不要写作下面的循环中
            for (int i = 0; i < len; i++) {
                TreeNode* front = q.front();
                temp.push_back(front->val);
                q.pop();
                if (front->left != nullptr) q.push(front->left);
                if (front->right != nullptr) q.push(front->right);
            }
            ans.push_back(temp);
        }
        return ans;
    }
};