Can you please implement this algorithm in C programing?

Breadth-first Tree Traversal Algorithm breadthFirst (root) Process tree using breadth-first traversal. Pre root is node to be processed Post tree has been processed l set currentNode to root 2 createQueue (bfQueue) 3 loop (currentNode not null) 1 process (currentNode) 2 if (left subtree not null) 1 enqueue (bfQueue, left subtree) 3 end if 4 if (right subtree not null) 1 enqueue (bfQueue, right subtree) 5 end if if (not emptyoueue (bfoueue)) 1 set currentNode to dequeue (bfQueue) 7 else 1 set currentNode to null 8 end if 4 end loop 5 destro end breadthFirst yQueue (bfQueue)