Breadth First Search in PHP for binary tree

breadthFirstSearch

<?php

Class Test extends SplQueue
{

}
$queue = [];

//SplQueue new object
$dummyQueue = new test();

//id is the root node you have to pass
$this->traverseTree($id, $dummyQueue);

function traverseTree($rootNode, $dummyQueue)
{
    if ($rootNode->lft != 0) {
        $dummyQueue->enqueue($rootNode->lft);
    }
    if ($rootNode->rgt != 0) {
        $dummyQueue->enqueue($rootNode->rgt);
    }
    if (!($dummyQueue->isEmpty())) {
        $nextId = $dummyQueue->dequeue();
        $nextNode = //get next node information using $nextId
        array_push($this->queue, $nextNode);
        $this->traverseTree($nextNode, $dummyQueue);
    }
}

?>