[传统算法] 二叉树的DFS、BFS遍历 C++ 实现

1. DFS - use recursion

    void dfs (TreeNode* root) {

        if(root){

            cout << root->val << ' ';

            dfs(root->left);

            dfs(root->right);           

        }
    }

2. BFS – use iteration(queue)

   

     void bfs(TreeNode* root) {

        if(root){

            queue<TreeNode*> q;

            q.push(root);

           

            while(!q.empty()){

                for(int i = 0, n = q.size(); i < n; i++){

                    TreeNode* node = q.front();

                    cout << node->val << ' ';

                    q.pop();

                    if(node->left) q.push(node->left);

                    if(node->right) q.push(node->right);  

                }

                cout << endl;

            }

        }

    }

其中树的数据结构参考leetcode上的写法

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */