[leetcode]102. 二叉树的层次遍历

BFS

/**
 * 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<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>>res;
        if(root == NULL)
        {
            return res;
        }
        queue<TreeNode*>q;
        q.push(root);
        int curCount = 1;       //当前这一层有几个结点
        while(!q.empty())
        {
            vector<int>temp;
            int nextCount = 0;      //下一层有几个结点
            for(int i = 0; i < curCount; i++)
            {
                TreeNode* cur = q.front();
                q.pop();
                temp.push_back(cur->val);
                if(cur->left != NULL) 
                {
                    q.push(cur->left);
                    nextCount++;
                }
                if(cur->right != NULL) 
                { 
                    q.push(cur->right); 
                    nextCount++;
                }
            }
            res.push_back(temp);
            curCount = nextCount;
        }
        return res;
    }
};

DFS：参考leetcode官方的

/**
 * 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 {
    vector<vector<int>>res;
    void helper(TreeNode *root,int curLevel)
    {
        if(root != NULL)
        {
            if(res.size() == curLevel)
            {
                res.push_back(vector<int>());
            }
            res[curLevel].push_back(root->val);
            if(root->left != NULL)
            {
                helper(root->left, curLevel + 1);
            }
            if(root->right != NULL)
            {
                helper(root->right, curLevel + 1);
            }
        }
    }
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        helper(root, 0);
        return res;
    }
};