C++ 的 queue 队列问题

Node *findMaxIdNode(int w){
        queue<Node*> idQueue;
        idQueue.push(&root);

        while (!idQueue.empty()){
            Node *currentNode = idQueue.front();
            idQueue.pop();
            if (currentNode->weight == w && currentNode != &root){
                return currentNode;
            }
            if (currentNode->rightNode){
                idQueue.push(currentNode->rightNode);
            }
            if (currentNode->leftNode){
                idQueue.push(currentNode->leftNode);
            }
        }
        return NULL;
    }