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

Complexity

Conditions	4
Paths	5

Size

Total Lines	16
Code Lines	10

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

<?php
    public function travel(Node $node, $visitor)
    {
        $stack = new \SplStack();
        $stack->push($node);

        while (!$stack->isEmpty()) {
            $stack->top();
            $node = $stack->pop();
            $visitor($node);

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