Slince\Tree\Traversal\BFS::travel()

Complexity

Conditions	4
Paths	5

Size

Total Lines	15
Code Lines	9

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

<?php
    public function travel(Node $node, $visitor)
    {
        $queue = new \SplQueue();
        $queue->enqueue($node);

        while (!$queue->isEmpty()) {
            $node = $queue->dequeue();
            $visitor($node);

            //压左子树
            if ($node->getLeft()) {
                $queue->push($node->getLeft());
            }
            if ($node->getRight()) {
                $queue->push($node->getRight());
            }
}