力扣-面试题04.03题 特定深度节点链表（C++）- dfs

题目链接：https://leetcode-cn.com/problems/list-of-depth-lcci/
题目如下：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    vector<ListNode*> listOfDepth(TreeNode* tree) {
        vector<ListNode*> res;
        if(!tree) return res;
        queue<TreeNode*> que;
        que.push(tree);

        while(que.size()){
            int size=que.size();
            ListNode* dummy=new ListNode(-1);
            ListNode* tail=dummy;

            while(size--){
                auto node=que.front();
                que.pop();
                tail->next=new ListNode(node->val);
                tail=tail->next;

                if(node->left) que.push(node->left);
                if(node->right) que.push(node->right);
            }

            res.push_back(dummy->next);
        }

        return res;

    }
};